Efficient Query Answering for OWL 2

Authors:
Héctor Pérez-Urbina;Ian Horrocks;Boris Motik
Affiliations:
Oxford University Computing Laboratory, Oxford, UK;Oxford University Computing Laboratory, Oxford, UK;Oxford University Computing Laboratory, Oxford, UK
Venue:
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Year:
2009

Citing 2
Cited 18

Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning

Completeness guarantees for incomplete reasoners

ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Optimized query rewriting for OWL 2 QL

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Using SPARQL with RDFS and OWL entailment

RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
QueryPIE: backward reasoning for OWL horst over very large knowledge bases

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Semantic Web search based on ontological conjunctive queries

Web Semantics: Science, Services and Agents on the World Wide Web
Reasoning with effects of clinical guideline actions using OWL: AL amyloidosis as a case study

KR4HC'11 Proceedings of the 3rd international conference on Knowledge Representation for Health-Care
A systemic approach for effective semantic access to cultural content

Semantic Web
Completeness guarantees for incomplete ontology reasoners: theory and practice

Journal of Artificial Intelligence Research
A sound and complete backward chaining algorithm for existential rules

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Ontology-based data access using views

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Engineering optimisations in query rewriting for OBDA

Proceedings of the 9th International Conference on Semantic Systems
On the exploration of the query rewriting space with existential rules

RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
First-order rewritability of atomic queries in horn description logics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Compact rewritings for existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Sound, complete, and minimal query rewriting for existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Ontology based query answering with existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Query rewriting under query refinements

Knowledge-Based Systems
Order matters! Harnessing a world of orderings for reasoning over massive data

Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

The QL profile of OWL 2 has been designed so that it is possible to use database technology for query answering via query rewriting. We present a comparison of our resolution based rewriting algorithm with the standard algorithm proposed by Calvanese et al., implementing both and conducting an empirical evaluation using ontologies and queries derived from realistic applications. The results indicate that our algorithm produces significantly smaller rewritings in most cases, which could be important for practicality in realistic applications.