Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Journal of Logic Programming
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries
IEEE Transactions on Knowledge and Data Engineering
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Magic Sets and their application to data integration
Journal of Computer and System Sciences
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Disjunctive asp with functions: Decidable queries and effective computation*
Theory and Practice of Logic Programming
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
SPARQL query answering over OWL ontologies
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
OWLIM: A family of scalable semantic repositories
Semantic Web
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
Hi-index | 0.00 |
Datalog∃ is the extension of Datalog allowing existentially quantified variables in rule heads. This language is highly expressive and enables easy and powerful knowledge-modelling, but the presence of existentially quantified variables makes reasoning over Datalog∃ undecidable in the general case. Restricted classes of Datalog∃, such as shy, have been proposed in the literature with the aim of enabling powerful, yet decidable query answering on top of Datalog∃ programs. However, in order to make such languages attractive it is necessary to guarantee good performance for query answering tasks. This paper works in this direction: improving the performance of query answering on Datalog∃. To this end, we design a rewriting method extending the well-known Magic-Sets technique to any Datalog∃ program. We demonstrate that our rewriting method preserves query equivalence on Datalog∃, and can be safely applied to shy programs. We therefore incorporate the Magic-Sets method in DLV∃, a system supporting shy. Finally, we carry out an experiment assessing the positive impact of Magic-Sets on DLV∃, and the effectiveness of the enhanced DLV∃ system compared to a number of state-of-the-art systems for ontology-based query answering.