Equivalences of logic programs
Proceedings on Third international conference on logic programming
Oriented equational logic programming is complete
Journal of Symbolic Computation
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Web Semantics: Science, Services and Agents on the World Wide Web
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
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Ontological queries: Rewriting and optimization
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Optimized query rewriting for OWL 2 QL
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Prexto: query rewriting under extensional constraints in DL-lite
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
| Hi-index | 0.00 |
Ontology-based data access (OBDA) systems use ontologies to provide views over relational databases. Most of these systems work with ontologies implemented in description logic families of reduced expressiveness, what allows applying efficient query rewriting techniques for query answering. In this paper we describe a set of optimisations that are applicable with one of the most expressive families used in this context (ELHIO). Our resulting system exhibits a behaviour that is comparable to the one shown by systems that handle less expressive logics.