Completeness Guaranteed Approximation for OWL DL Query Answering

Jeff Z Pan, Edward Thomas, Yuting Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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
Title of host publicationProceedings of the 22nd International Workshop on Description Logics (DL2009)
EditorsBernardo Cuenca Grau, Ian Horrocks, Boris Motik, Ulrike Sattler
PublisherCEUR Workshop Proceedings
Number of pages12
Publication statusPublished - 8 Jul 2009
EventThe 22nd International Workshop on Description Logics 2009
- Oxford, United Kingdom
Duration: 27 Jul 200930 Jul 2009
Conference number: 22
http://dl.kr.org/dl2009/

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR-WS.org
Volume477
ISSN (Electronic)1613-0073

Conference

ConferenceThe 22nd International Workshop on Description Logics 2009
Abbreviated titleDL 2009
Country/TerritoryUnited Kingdom
CityOxford
Period27/07/0930/07/09
Internet address

Fingerprint

Dive into the research topics of 'Completeness Guaranteed Approximation for OWL DL Query Answering'. Together they form a unique fingerprint.

Cite this