Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Bridging the gap between OWL and relational databases
Web Semantics: Science, Services and Agents on the World Wide Web
The DL-lite family and relations
Journal of Artificial Intelligence Research
Journal on data semantics X
The MASTRO system for ontology-based data access
Semantic Web
TrOWL: tractable OWL 2 reasoning infrastructure
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Engineering optimisations in query rewriting for OBDA
Proceedings of the 9th International Conference on Semantic Systems
RDFS and OWL reasoning for linked data
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
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
Query rewriting under query refinements
Knowledge-Based Systems
| Hi-index | 0.00 |
In this paper we present Prexto, an algorithm for computing a perfect rewriting of unions of conjunctive queries over ontologies expressed in the description logic DL−Lite. The main novelty of Prexto lies in the fact that it constitutes the first technique for query rewriting over ontologies which fully exploits extensional constraints to optimize query rewriting. In addition, Prexto makes use of functional role axioms and of concept and role disjointness axioms to optimize the size of the rewritten query. We show that these optimizations allow Prexto to outperform the existing query rewriting techniques for DL−Lite in practical cases.