Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Ontobroker: Ontology Based Access to Distributed and Semi-Structured Information
DS-8 Proceedings of the IFIP TC2/WG2.6 Eighth Working Conference on Database Semantics- Semantic Issues in Multimedia Systems
The Description Logic Handbook
The Description Logic Handbook
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Web Semantics: Science, Services and Agents on the World Wide Web
Approximate OWL-Reasoning with Screech
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
Approximating OWL-DL ontologies
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Conservative extensions in expressive description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity in the ƐL family of description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Journal on data semantics X
Repairing ontologies for incomplete reasoners
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
A description logic for inferencenet.br
PROPOR'12 Proceedings of the 10th international conference on Computational Processing of the Portuguese Language
Description logic TBoxes: model-theoretic characterizations and rewritability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
From OWL to DL−Lite through efficient ontology approximation
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve answers to user queries by taking into account domain knowledge. In the context of OBDA applications, an important issue is that of reusing existing domain ontologies. However, such ontologies are often formulated in expressive languages, which are incompatible with the requirements of efficiently accessing large amounts of data. Approximation of such ontologies by means of less expressive ones has been proposed as a possible solution to this problem. 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. The point of interest in DL-LiteA approximations is capturing entailments involving chains of existential role restrictions, which can play an essential role in query answering. The presence of TBox assertions involving existential chains affects query answering by enriching the number of obtained rewritings, and hence allows us to cope better with incomplete information about object and data properties. We provide an approximation algorithm and show its soundness and completeness. We also discuss the implementation of the algorithm.