Skip to main content

Expressive Approximations in DL-Lite Ontologies

Botoeva, Elena, Calvanese, Diego, Rodriguez-Muro, Mariano (2010) Expressive Approximations in DL-Lite Ontologies. In: Artificial Intelligence: Methodology, Systems, and Applications 14th International Conference, AIMSA 2010, Varna, Bulgaria, September 8-10. 2010. Proceedings. Lecture Notes in Computer Science , 6304. pp. 21-31. Springer ISBN 978-3-642-15430-0. E-ISBN 978-3-642-15431-7. (doi:10.1007/978-3-642-15431-7_3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:91294)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL
https://doi.org/10.1007/978-3-642-15431-7_3

Abstract

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.

Item Type: Conference or workshop item (Proceeding)
DOI/Identification number: 10.1007/978-3-642-15431-7_3
Uncontrolled keywords: Description Logic; Conservative Extension; Query Answering; Complete Approximation; Concept Inclusion
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Amy Boaler
Date Deposited: 03 Nov 2021 12:18 UTC
Last Modified: 16 Nov 2021 10:27 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/91294 (The current URI for this page, for reference purposes)
  • Depositors only (login required):