Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Efficient Query Answering for OWL 2
ISWC '09 Proceedings of the 8th International Semantic Web Conference
The DL-lite family and relations
Journal of Artificial Intelligence Research
Journal on data semantics X
Query rewriting under ontology contraction
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
An integrated environment for reasoning over ontologies via logic programming
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
First-order rewritability of atomic queries in horn description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing datalog rewritings beyond horn ontologies
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
Hi-index | 0.00 |
The OWL 2 QL profile has been designed to facilitate query answering via query rewriting. This paper presents an optimized query rewriting algorithm which takes advantage of the special characteristics of the query rewriting problem via first-order resolution in OWL 2 QL and computes efficiently the rewriting set of a user query, by avoiding blind and unnecessary inferences, as well as by reducing the need for extended subsumption checks. The evaluation shows that in several cases the algorithm achieves a significant improvement and better practical scalability if compared to other similar approaches.