Approximating OWL-DL Ontologies

Jeff Z Pan, Edward James Thomas

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution


Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, 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. We identify a useful category of queries for which our approach guarantees also completeness. Furthermore, this paper reports on the implementation of our approach in the ONTOSEARCH2 system and preliminary, but encouraging, benchmark results which compare ONTOSEARCH2's response times on a number of queries with those of existing ontology reasoning systems.
Original languageEnglish
Title of host publicationAAAI'07 Proceedings of the 22nd national conference on Artificial intelligence
EditorsAnthony Cohn
PublisherAAAI Press
Number of pages6
ISBN (Print)978-1-57735-323-2
Publication statusPublished - 2007
EventTwenty-Second Conference on Artificial Intelligence (AAAI-07) - British Columbia, Vancouver, United Kingdom
Duration: 22 Jul 200726 Jul 2007


ConferenceTwenty-Second Conference on Artificial Intelligence (AAAI-07)
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Approximating OWL-DL Ontologies'. Together they form a unique fingerprint.

Cite this