Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fast Query Answering over Existential Rules

Fast Query Answering over Existential Rules Enhancing Datalog with existential quantification gives rise to Datalog, a powerful knowledge representation language widely used in ontology-based query answering. In this setting, a conjunctive query is evaluated over a Datalog program consisting of extensional data paired with so-called “existential” rules. Owing to their high expressiveness, such rules make the evaluation of queries undecidable, even when the latter are atomic. Decidable generalizations of Datalog by existential rules have been proposed in the literature (such as weakly acyclic and weakly guarded); but they pay the price of higher computational complexity, hindering the implementation of effective systems. Conversely, the results in this article demonstrate that it is definitely possible to enable fast yet powerful query answering over existential rules that strictly generalize Datalog by ensuring decidability without any complexity overhead. On the theoretical side, we define the class of parsimonious programs that guarantees decidability of atomic queries. We then strengthen this class to strongly parsimonious programs ensuring decidability also for conjunctive queries. Since parsimony is an undecidable property, we single out Shy, an easily recognizable class of strongly parsimonious programs that generalizes Datalog while preserving its complexity even under conjunctive queries. Shy also generalizes the class of linear existential programs, while it is uncomparable to the other main classes ensuring decidability. On the practical side, we exploit our results to implement DLV, an effective system for query answering over parsimonious existential rules. To assess its efficiency, we carry out an experimental analysis, evaluating DLV performances for ontology-based query answering on both real-world and synthetic ontologies. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/fast-query-answering-over-existential-rules-cCSlsyE60l

References (97)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2019 ACM
ISSN
1529-3785
eISSN
1557-945X
DOI
10.1145/3308448
Publisher site
See Article on Publisher Site

Abstract

Enhancing Datalog with existential quantification gives rise to Datalog, a powerful knowledge representation language widely used in ontology-based query answering. In this setting, a conjunctive query is evaluated over a Datalog program consisting of extensional data paired with so-called “existential” rules. Owing to their high expressiveness, such rules make the evaluation of queries undecidable, even when the latter are atomic. Decidable generalizations of Datalog by existential rules have been proposed in the literature (such as weakly acyclic and weakly guarded); but they pay the price of higher computational complexity, hindering the implementation of effective systems. Conversely, the results in this article demonstrate that it is definitely possible to enable fast yet powerful query answering over existential rules that strictly generalize Datalog by ensuring decidability without any complexity overhead. On the theoretical side, we define the class of parsimonious programs that guarantees decidability of atomic queries. We then strengthen this class to strongly parsimonious programs ensuring decidability also for conjunctive queries. Since parsimony is an undecidable property, we single out Shy, an easily recognizable class of strongly parsimonious programs that generalizes Datalog while preserving its complexity even under conjunctive queries. Shy also generalizes the class of linear existential programs, while it is uncomparable to the other main classes ensuring decidability. On the practical side, we exploit our results to implement DLV, an effective system for query answering over parsimonious existential rules. To assess its efficiency, we carry out an experimental analysis, evaluating DLV performances for ontology-based query answering on both real-world and synthetic ontologies.

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Mar 27, 2019

Keywords: Datalog

There are no references for this article.