Filters








1,100 Hits in 2.5 sec

Expressive Approximations in DL-Lite Ontologies [chapter]

Elena Botoeva, Diego Calvanese, Mariano Rodriguez-Muro
2010 Lecture Notes in Computer Science  
In this work we present our approach to semantic (as opposed to syntactic) approximation of OWL 2 TBoxes by means of TBoxes in DL-LiteA.  ...  Approximation of such ontologies by means of less expressive ones has been proposed as a possible solution to this problem.  ...  In this paper we focus on sound and complete semantic approximations of OWL 2 ontologies by means of DL-Lite ontologies: specifically, as target ontology language we consider DL-Lite A , which is an expressive  ... 
doi:10.1007/978-3-642-15431-7_3 fatcat:3jvgohq6dzalhknd6pj6r7pu3a

Efficient Approximation in DL-Lite of OWL 2 Ontologies

Marco Console, Valerio Santarelli, Domenico Fabio Savo
2013 International Workshop on Description Logics  
In this work we present our notion of ontology approximation and present an algorithm for computing the approximation of OWL 2 ontologies by means of DL-Lite TBoxes.  ...  In this scenario, the approximation of ontologies expressed in very expressive languages through ontologies expressed in languages which keep the computational complexity of the reasoning tasks low is  ...  Approximation in DL-Lite A of OWL 2 ontologies In this section, we study the problem of computing the approximation in DL-Lite A of a satisfiable OWL 2 ontology O.  ... 
dblp:conf/dlog/ConsoleSS13 fatcat:mizg75b7azbtplblbutqbd4jo4

On Instance-level Update and Erasure in Description Logic Ontologies

G. De Giacomo, M. Lenzerini, A. Poggi, R. Rosati
2008 Journal of Logic and Computation  
base in a DL L may not be expressible by ABoxes in L.  ...  get polynomial algorithms for approximated instance-level update and erasure for DL-Lite F .  ...  (2) We study instance-level update in the case where the ontology is expressed in DL-Lite F [8] .  ... 
doi:10.1093/logcom/exn051 fatcat:ghpy5p7mrrgd7gsd4rcscsyi3y

Efficient Query Answering Through Approximation

Edward Thomas, Jeff Z. Pan
2007 International Workshop on Description Logics  
In this poster, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity.  ...  Furthermore, we paper report on the implementation of our approach in the ONTOSEARCH2 system.  ...  Namely, we propose approximating OWL DL ontologies [4] (or simply source ontologies) with corresponding DL-Lite [5, 6] ontologies (or simply target ontologies), against which query answering has only  ... 
dblp:conf/dlog/ThomasP07 fatcat:23h45til3rhiffl5za4mocqf5e

ONTOSEARCH2: Searching Ontologies Semantically

Edward Thomas, Jeff Z. Pan, Derek H. Sleeman
2007 W3C Web Ontology Language (OWL) Experiences and Directions Workshop (OWLED)  
In this paper, we present an ontology search engine, ONTOSEARCH2, which provides three approaches to searching ontologies semantically.  ...  Existing approaches are mainly based on keywords and metadata information of ontologies, rather than semantic entailments of ontologies.  ...  DL-Lite The trade-off between expressive power and efficiency has been one of the main themes in Description Logic research.  ... 
dblp:conf/owled/ThomasPS07 fatcat:m2mpti5tejblxmjgcyaiclun3a

Virtual OBDA over Expressive Ontologies: Rewritings and Approximations

Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Fabio Savo, Alessandro Solimando, Guohui Xiao
2016 International Workshop on Description Logics  
In this paper we extend virtual OBDA to more expressive ontology languages than that of DL-LiteR, which is the logic underpinning the W3C ontology language OWL 2.  ...  We achieve this by relying on two well-known mechanisms, namely conservative rewriting and approximation, and compiling some of the domain semantics into OBDA mappings.  ...  We consider ontologies expressed in Description Logics (DLs).  ... 
dblp:conf/dlog/BotoevaCSSSX16 fatcat:76wjsbgxujb3bgkhawdga7r4yq

Beyond OWL 2 QL in OBDA: Rewritings and Approximations

Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Savo, Alessandro Solimando, Guohui Xiao
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Specifically, we develop techniques to rewrite OBDA specifications with an expressive ontology to "equivalent" ones with a DL-Lite_R ontology, if possible, and to approximate them otherwise.  ...  database engine, and thus is restricted in expressive power.  ...  We consider ontologies expressed in Description Logics (DLs).  ... 
doi:10.1609/aaai.v30i1.10102 fatcat:rch3rbfwefhkjarsp23uh4lag4

Beyond OWL 2 QL in OBDA: Rewritings and Approximations (Extended Version) [article]

Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Fabio Savo, Alessandro Solimando, Guohui Xiao
2015 arXiv   pre-print
Specifically, we develop techniques to rewrite OBDA specifications with an expressive ontology to "equivalent" ones with a DL-Lite_R ontology, if possible, and to approximate them otherwise.  ...  database engine, and thus is restricted in expressive power.  ...  We consider ontologies expressed in Description Logics (DLs).  ... 
arXiv:1511.08412v2 fatcat:mymb4pc7sve3reboso4wll5dgi

On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies

Meghyn Bienvenu
2021 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We conclude by extending our positive results to DL-Lite ontologies without inverse.  ...  Recent work on consistent query answering in the presence of ontologies has shown this problem to be intractable in data complexity even for ontologies expressed in lightweight description logics.  ...  of DL-Lite ontologies.  ... 
doi:10.1609/aaai.v26i1.8218 fatcat:5eavfcgoorffha4znlxpbpbxry

Towards Scalable Instance Retrieval over Ontologies [chapter]

Alissa Kaplunova, Ralf Möller, Sebastian Wandelt, Michael Wessel
2010 Lecture Notes in Computer Science  
Traditional reasoning systems may have problems to deal with large amounts of expressive ontological data (terminological as well as assertional data) that usually must be kept in main memory.  ...  In this paper, we consider the problem of query answering over multimedia ontologies.  ...  We believe that rather expressive DLs such as SHI are required in order to capture important domain constraints in an ontology (e.g., less expressive DLs may not provide the required expressivity for the  ... 
doi:10.1007/978-3-642-15280-1_40 fatcat:p7flolc6lzdqrabzalwhalhawy

Relaxed Regular Path Queries in Lightweight DLs (Extended Abstract)

Oliver Fernández Gil, Anni-Yasmin Turhan
2020 International Workshop on Description Logics  
The goal of this paper is to define approximate semantics for answering C2RPQs in DLs and to devise computation algorithms for answering them in the DLs ELH and DL-Lite R .  ...  Answering conjunctive 2-way regular path queries (C2RPQs) has been studied for very expressive DLs [4] , and for the EL and DL-Lite families of lightweight DLs [3, 13, 2] .  ... 
dblp:conf/dlog/GilT20 fatcat:eyow2lqcpvfini3rbrmzxc3zdi

Mobile Context-Addressable Messaging with DL-Lite Domain Model [chapter]

Michal Koziuk, Jaroslaw Domaszewicz, Radoslaw Olgierd Schoeneich, Marcin Jablonowski, Piotr Boetzel
2008 Lecture Notes in Computer Science  
The combination of the DL-Lite logic, Manchester OWL Syntax, a customized implementation of the JENA API, and an o-the-shelf relational database oers an environment which makes it possible to use ontologies  ...  This paper describes an architecture for ontology based context modeling on mobile devices.  ...  Acknowledgements The authors would like to thank Ellen Munthe-Kaas from the University of Oslo, for a suggestion to use DL-Lite.  ... 
doi:10.1007/978-3-540-88793-5_13 fatcat:dbbd7x2yjfc4pauf3fxm3wz7uu

A Note on DL-Lite with Boolean Role Inclusions

Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
2019 International Workshop on Description Logics  
We discuss the complexity of reasoning and ontology-mediated query answering with the logics from the DL-Lite family extended by various types (Horn, Krom and Boolean) of role inclusions.  ...  We compare the expressive power of those logics with 1-and 2-variable fragments of first-order logic.  ...  We give a concise description of the expressivity of both DL-Lite bool bool and DL-Lite g-bool bool ontologies within those more familiar description logics.  ... 
dblp:conf/dlog/KontchakovRWZ19 fatcat:al2ic37fhvbupiw2r2xdes62r4

Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies

Meghyn Bienvenu
2012 International Workshop on Description Logics  
of DL-Lite core ontologies.  ...  Finally, in order to treat more expressive ontologies, and to demonstrate the applicability of our techniques, we show how our positive results can be extended to handle DL-Lite core ontologies without  ... 
dblp:conf/dlog/Bienvenu12 fatcat:bhk6chwssng7blr6cwi7wxj63a

Designing Efficient Controlled Languages for Ontologies [chapter]

Camilo Thorne, Raffaella Bernardi, Diego Calvanese
2014 Text, Speech and Language Technology  
Note that in DL-Lite, negation is used only to express disjointness, as in the statement in Figure 1 .  ...  In fact, DL-Lite core represents a core part shared by all logics of the DL-Lite family. Definition 1 (DL-Lite core and DL-Lite R, ).  ...  Appendix In this appendix we sketch how CG-lite formally captures DL-Lite R, (and a fortiori DL-Lite core ).  ... 
doi:10.1007/978-94-007-7284-7_9 fatcat:2mpkjybjajephptibqoxjypdoq
« Previous Showing results 1 — 15 out of 1,100 results