Completeness guaranteed approximation for OWL DL query answering

Jeff Z. Pan*, Edward Thomas, Yuting Zhao

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

12 Citations (Scopus)


How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a soundness guaranteed approximation, which transforms an ontology in a more expressive DL to its least upper bound approximation in a tractable DL. In this paper, we investigate a completeness guaranteed approximation, based on transformations of both the source ontology and input queries. We have implemented both soundness guaranteed and completeness guaranteed approximations in our TrOWL ontology reasoning infrastructure.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalCEUR Workshop Proceedings
Publication statusPublished - 1 Dec 2009
Event22nd International Workshop on Description Logics, DL 2009 - Oxford, United Kingdom
Duration: 27 Jul 200930 Jul 2009 (Link to Official Website)


Dive into the research topics of 'Completeness guaranteed approximation for OWL DL query answering'. Together they form a unique fingerprint.

Cite this