Paper Info
Title
Hybrid Query Answering Over OWL Ontologies.
Abstract
Query answering over OWL 2 DL ontologies is an important reasoning task for many modern applications. Unfortunately, due to its high computational complexity, OWL 2 DL systems are still not able to cope with datasets containing billions of data. Consequently, application developers often employ provably scalable systems which only support a fragment of OWL 2 DL and which are, hence, most likely incomplete for the given input. However, this notion of completeness is too coarse since it implies that there exists some query and some dataset for which these systems would miss answers. Nevertheless, there might still be a large number of user queries for which they can compute all the right answers even over OWL 2 DL ontologies. In the current paper, we investigate whether, given a query Q with only distinguished variables over an OWL 2 DL ontology T and a system ans, it is possible to identify in an efficient way if ans is complete for Q, T and every dataset. We give sufficient conditions for (in) completeness and present a hybrid query answering algorithm which uses ans when it is complete, otherwise it falls back to a fully-fledged OWL 2 DL reasoner. However, even in the latter case, our algorithm still exploits ans as much as possible in order to reduce the search space of the OWL 2 DL reasoner. Finally, we have implemented our approach using a concrete system ans and OWL 2 DL reasoner obtaining encouraging results.
Year
DOI
Venue
2014
10.3233/978-1-61499-419-0-855
Frontiers in Artificial Intelligence and Applications
Field
DocType
Volume
Ontology (information science),Ontology,Semantic reasoner,Information retrieval,Existential quantification,Computer science,Completeness (statistics),Web Ontology Language,Computational complexity theory,Scalability
Conference
263
ISSN
Citations 
PageRank 
0922-6389
3
0.39
References 
Authors
10
2
Name
Order
Citations
PageRank
Giorgos Stoilos1124167.47
Giorgos Stamou2120076.88