Paper Info
Title
Completeness Guaranteed Approximations for OWL-DL Query Answering
Abstract
Abstract. How to provide scalable and quality guaranteed approximation,for query answering,over expressive description logics (DLs) is an important prob- lem 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 approxi- mation, 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.
Year
Venue
Keywords
2009
Description Logics
knowledge representation,description logic,web ontology language,upper bound,conjunctive queries
Field
DocType
Citations 
Query optimization,RDF query language,Query language,Conjunctive query,Query expansion,Computer science,Web query classification,Description logic,Theoretical computer science,Soundness
Conference
14
PageRank 
References 
Authors
0.69
11
3
Name
Order
Citations
PageRank
Jeff Z. Pan12218158.01
Edward Thomas21719.54
Yuting Zhao312613.47