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.
- Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases: The Logical Level. Addison-Wesley Longman Publishing Co., Inc. Google ScholarDigital Library
- Andrea Acciarri, Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Mattia Palmieri, and Riccardo Rosati. 2005. QUONTO: Querying ontologies. In Proceedings of AAAI’05, Vol. 4. AAAI Press, 1670--1671. Google ScholarDigital Library
- Mario Alviano, Wolfgang Faber, Nicola Leone, and Marco Manna. 2012. Disjunctive Datalog with existential quantifiers: Semantics, decidability, and complexity issues. Theory and Practice of Logic Programming 12, 4-5 (2012), 701--718. Google ScholarDigital Library
- Mario Alviano, Michael Morak, and Andreas Pieris. 2017. Stable model semantics for tuple-generating dependencies revisited. In Proceedings of PODS’17. ACM, 377--388. Google ScholarDigital Library
- Mario Alviano and Andreas Pieris. 2015. Default negation for non-guarded existential rules. In Proceedings of PODS’15. ACM, 79--90. Google ScholarDigital Library
- Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. 2009. The DL-Lite family and relations. Journal of Artificial Intelligence Research 36 (2009), 1--69. Google ScholarDigital Library
- Franz Baader, Sebastian Brandt, and Carsten Lutz. 2005. Pushing the EL envelope. In Proceedings of IJCAI’05. AAAI Press, 364--369. Google ScholarDigital Library
- Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. 2011. On rules with existential variables: Walking the decidability line. Artificial Intelligence 175, 9-10 (2011), 1620--1654. Google ScholarDigital Library
- Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Michaël Thomazo. 2011. Walking the complexity lines for generalized guarded existential rules. In Proceedings of IJCAI’11. AAAI Press, 712--717. Google ScholarDigital Library
- Jean-François Baget, Michel Leclère, and Marie-Laure Mugnier. 2010. Walking the decidability line for rules with existential variables. In Proceedings of KR’10. AAAI Press, 466--476. Google ScholarDigital Library
- Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Swan Rocher, and Clément Sipieter. 2015. Graal: A toolkit for query answering with existential rules. In Proceedings of RuleML’15. Springer, 328--344.Google ScholarCross Ref
- Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. 2009. Extending decidable cases for rules with existential variables. In Proceedings of IJCAI’09. AAAI Press, 677--682. Google ScholarDigital Library
- Vince Bárány, Georg Gottlob, and Martin Otto. 2014. Querying the guarded fragment. Logical Methods in Computer Science 10, 2 (2014), 1--35.Google ScholarCross Ref
- Catriel Beeri and Moshe Y. Vardi. 1981. The implication problem for data dependencies. In Proceedings of ICALP’81. Springer, 73--85. Google ScholarDigital Library
- Luigi Bellomarini, Emanuel Sallinger, and Georg Gottlob. 2018. The Vadalog system: Datalog-based reasoning for knowledge graphs. Proceedings of the VLDB Endowment 11, 9 (2018), 975--987. Google ScholarDigital Library
- Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, and Efthymia Tsamoura. 2017. Benchmarking the chase. In Proceedings of PODS’17. ACM, 37--52. Google ScholarDigital Library
- Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. 2014. Ontology-based data access: A study through disjunctive Datalog, CSP, and MMSNP. ACM Transactions on Database Systems 39, 4 (2014), 33:1--33:44. Google ScholarDigital Library
- Barry Bishop, Atanas Kiryakov, Damyan Ognyanoff, Ivan Peikov, Zdravko Tashev, and Ruslan Velkov. 2011. OWLIM: A family of scalable semantic repositories. Semantic Web 2 (2011), 33--42. Google ScholarDigital Library
- Pierre Bourhis, Marco Manna, Michael Morak, and Andreas Pieris. 2016. Guarded-based disjunctive tuple-generating dependencies. ACM Transactions on Database Systems 41, 4 (2016), 27:1--27:45. Google ScholarDigital Library
- Pierre Bourhis, Michael Morak, and Andreas Pieris. 2017. Making cross products and guarded ontology languages compatible. In Proceedings of IJCAI’17. ijcai.org, 880--886. Google ScholarDigital Library
- Sebastian Brandt. 2004. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In Proceedings of PAIS’04. IOS Press, 298--302. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Michael Kifer. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proceedings of KR’08. AAAI Press, 70--80. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Michael Kifer. 2013. Taming the infinite chase: Query answering under expressive relational constraints. Journal of Artificial Intelligence Research 48 (2013), 115--174. Google ScholarCross Ref
- Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2009. A general Datalog-based framework for tractable query answering over ontologies. In Proceedings of PODS’09. ACM, 77--86. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2009. Datalog<sup>±</sup>: A unified approach to ontologies and integrity constraints. In Proceedings of ICDT’09. 14--30. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2009. Tractable query answering over ontologies with Datalog+/-. In Proceedings of DL Workshop 2009. 1--12.Google Scholar
- Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2012. A general Datalog-based framework for tractable query answering over ontologies. Journal of Web Semantics 14 (2012), 57--83. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Andreas Pieris. 2010. Advanced processing for ontological queries. Proceedings of the VLDB Endowment 3, 1 (2010), 554--565. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Andreas Pieris. 2010. Query answering under non-guarded rules in Datalog. In Proceedings of RR’10, Vol. 6333. Springer, 1--17. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Andreas Pieris. 2012. Towards more expressive ontology languages: The query answering problem. Artificial Intelligence 193 (2012), 87--128. Google ScholarDigital Library
- Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, and Nicola Leone. 2010. Enhancing ASP by functions: Decidable classes and implementation techniques. In Proceedings of AAAI’10. AAAI Press, 1666--1670. Google ScholarDigital Library
- Diego Calvanese, Benjamin Cogrel, Sarah Komla-Ebri, Roman Kontchakov, Davide Lanti, Martin Rezk, Mariano Rodriguez-Muro, and Guohui Xiao. 2017. Ontop: Answering SPARQL queries over relational databases. Semantic Web 8, 3 (2017), 471--487.Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automated Reasoning 39, 3 (2007), 385--429. Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. 2013. Data complexity of query answering in description logics. Artificial Intelligence 195 (2013), 335--360. Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Mariano Rodriguez-Muro, Riccardo Rosati, Marco Ruzzi, and Domenico Fabio Savo. 2011. The MASTRO system for ontology-based data access. Semantic Web 2, 1 (2011), 43--53. Google ScholarCross Ref
- Alexandros Chortaras, Despoina Trivela, and Giorgos Stamou. 2011. Optimized query rewriting for OWL 2 QL. In Proceedings of CADE’11. Springer, 192--206. Google ScholarDigital Library
- Cristina Civili and Riccardo Rosati. 2012. A broad class of first-order rewritable tuple-generating dependencies. In Proceedings of Datalog 2.0 2012. 68--80. Google ScholarDigital Library
- Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos, and Ian Horrocks. 2012. Completeness guarantees for incomplete ontology. reasoners: Theory and practice. Journal of Artificial Intelligence Research 43 (2012), 419--476. Google ScholarDigital Library
- Chiara Cumbo, Wolfgang Faber, Gianluigi Greco, and Nicola Leone. 2004. Enhancing the magic-set method for disjunctive Datalog programs. In Proceedings of ICLP’04, Vol. 3132. Springer, 371--385.Google ScholarCross Ref
- Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys 33 (2001), 374--425. Google ScholarDigital Library
- Alin Deutsch, Alan Nash, and Jeff Remmel. 2008. The chase revisited. In Proceedings of PODS’08. ACM, 149--158. Google ScholarDigital Library
- Thomas Eiter, Magdalena Ortiz, Mantas Simkus, Trung-Kien Tran, and Guohui Xiao. 2012. Query rewriting for Horn-SHIQ plus rules. In Proceedings of AAAI’12. AAAI Press, 726--733. Google ScholarDigital Library
- Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. 2005. Data exchange: Semantics and query answering. Theoretical Computer Science 336, 1 (2005), 89--124. Google ScholarCross Ref
- O. Febbraro, N. Leone, F. Ricca, G. Terracina, and P. Veltri. 2013. A graphic tool for ontology reasoning under Datalog<sup>∃</sup>. In Proceedings of SEBD’13. Curran Associates, 51--62.Google Scholar
- Birte Glimm, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. 2008. Conjunctive query answering for the description logic SHIQ. Journal of Artificial Intelligence Research 31, 1 (2008), 157--204. Google ScholarDigital Library
- Tomasz Gogacz and Jerzy Marcinkowski. 2013. Converging to the chase—a tool for finite controllability. In Proceedings of LICS’13. IEEE Computer Society, 540--549. Google ScholarDigital Library
- Georg Gottlob, André Hernich, Clemens Kupke, and Thomas Lukasiewicz. 2014. Stable model semantics for guarded existential rules and description logics. In Proceedings of KR’14. 258--267. Google ScholarDigital Library
- Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, and Michael Zakharyaschev. 2014. The price of query rewriting in ontology-based data access. Artificial Intelligence 213 (2014), 42--59. Google ScholarDigital Library
- Georg Gottlob, Marco Manna, and Andreas Pieris. 2013. Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming 13, 4-5 (2013), 877--892.Google ScholarCross Ref
- Georg Gottlob, Giorgio Orsi, and Andreas Pieris. 2014. Query rewriting and optimization for ontological databases. ACM Transactions on Database Systems 39, 3 (2014), 25:1--25:46. Google ScholarDigital Library
- Georg Gottlob, Andreas Pieris, and Lidia Tendera. 2013. Querying the guarded fragment with transitivity. In Proceedings of ICALP’13. Springer, 287--298. Google ScholarDigital Library
- Bernardo Cuenca Grau, Ian Horrocks, Markus Krötzsch, Clemens Kupke, Despoina Magka, Boris Motik, and Zhe Wang. 2013. Acyclicity notions for existential rules and their application to query answering in ontologies. Journal of Artificial Intelligence Research 47 (2013), 741--808. Google ScholarDigital Library
- Sergio Greco, Francesca Spezzano, and Irina Trubitsyna. 2011. Stratification criteria and rewriting techniques for checking chase termination. Proceedings of the VLDB Endowment 4, 11 (2011), 1158--1168.Google ScholarDigital Library
- Yuanbo Guo, Zhengxiang Pan, and Jeff Heflin. 2005. LUBM: A benchmark for OWL knowledge base systems. Journal of Web Semantics 3 (2005), 158--182. See http://swat.cse.lehigh.edu/projects/lubm/. Google ScholarDigital Library
- V. Haarslev and R. Möller. 2001. RACER system description. In Proceedings of IJCAR’01. Springer, 701--705. Google ScholarDigital Library
- U. Hustadt, B. Motik, and U. Sattler. 2004. Reducing SHIQ-description logic to disjunctive Datalog programs. In Proceedings of KR’04. AAAI Press, 152--162. Google ScholarDigital Library
- David S. Johnson and Anthony C. Klug. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences 28, 1 (1984), 167--189.Google ScholarCross Ref
- Ton Kloks. 1994. Treewidth, Computations and Approximations, Lecture Notes in Computer Science, Vol. 842. Springer, Berlin.Google Scholar
- Mélanie König, Michel Leclere, and Marie-Laure Mugnier. 2015. Query rewriting for existential rules with compiled preorder. In Proceedings of IJCAI’15. AAAI Press, 3106--3112. Google ScholarDigital Library
- Markus Krötzsch and Sebastian Rudolph. 2011. Extending decidable existential rules by joining acyclicity and guardedness. In Proceedings of IJCAI’11. AAAI Press, 963--968. Google ScholarDigital Library
- Nicola Leone, Marco Manna, Giorgio Terracina, and Pierfrancesco Veltri. 2012. Efficiently computable Datalog<sup>∃</sup> programs. In Proceedings of KR’12. AAAI Press, 13--23. Google ScholarDigital Library
- Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3 (2006), 499--562. Google ScholarDigital Library
- Carsten Lutz, Inanç Seylan, David Toman, and Frank Wolter. 2013. The combined approach to OBDA: Taming role hierarchies using filters. In Proceedings of ISWC’13. Springer, 314--330. Google ScholarDigital Library
- David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv. 1979. Testing implications of data dependencies. ACM Transactions on Database Systems 4, 4 (1979), 455--469. Google ScholarDigital Library
- Bruno Marnette. 2009. Generalized schema-mappings: From termination to tractability. In Proceedings of PODS’09. ACM, 13--22. Google ScholarDigital Library
- Michael Meier, Michael Schmidt, and Georg Lausen. 2009. On chase termination beyond stratification. Proceedings of the VLDB Endowment 2, 1 (2009), 970--981. Google ScholarDigital Library
- Boris Motik, Rob Shearer, and Ian Horrocks. 2009. Hypertableau reasoning for description logics. Journal of Artificial Intelligence Research 36 (2009), 165--228. Google ScholarCross Ref
- Marie-Laure Mugnier. 2011. Ontological query answering with existential rules. In Proceedings of RR 2011. 2--23. Google ScholarDigital Library
- Héctor Pérez-Urbina, Ian Horrocks, and Boris Motik. 2009. Efficient query answering for OWL 2. In Proceedings of ISWC’09. Springer, 489--504. Google ScholarDigital Library
- Héctor Pérez-Urbina, Boris Motik, and Ian Horrocks. 2010. Tractable query answering and rewriting under description logic constraints. Journal of Applied Logic 8, 2 (2010), 186--209.Google ScholarCross Ref
- Mariano Rodriguez-Muro and Diego Calvanese. 2011. Dependencies: Making ontology based data access work in practice. In Proceedings of AMW’11, Vol. 477. CEUR-WS.org, 1--12.Google Scholar
- Mariano Rodriguez-Muro and Diego Calvanese. 2011. Dependencies to optimize ontology based data access. In Proceedings of DL Workshop’11, Vol. 745. CEUR-WS.org, 1--11.Google Scholar
- Riccardo Rosati. 2007. On conjunctive query answering in EL. In Proceedings of DL Workshop’07. 1--8.Google Scholar
- R. Rosati and A. Almatelli. 2010. Improving query answering over DL-Lite ontologies. In Proceedings of KR’10. AAAI Press, 290--300. Google ScholarDigital Library
- Sebastian Rudolph, Markus Krötzsch, and Pascal Hitzler. 2008. All Elephants are bigger than all mice. In Proceedings of DL Workshop’08, Vol. 353. CEUR-WS.org, 1--11.Google Scholar
- Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, and Yarden Katz. 2007. Pellet: A practical OWL-DL reasoner. Journal of Web Semantics 5, 2 (2007), 51--53. Google ScholarDigital Library
- Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, and Giorgos Stamou. 2015. Optimising resolution-based rewriting algorithms for OWL ontologies. Journal of Web Semantics 33 (2015), 30--49.Google ScholarCross Ref
- Dmitry Tsarkov and Ian Horrocks. 2006. FaCT++ description logic reasoner: System description. In Proceedings of IJCAR’06, Vol. 4130. Springer, 292--297. Google ScholarDigital Library
- Jacopo Urbani, Markus Krötzsch, Ceriel J. H. Jacobs, Irina Dragoste, and David Carral. 2018. Efficient model construction for horn logic with VLog—system description. In Proceedings of IJCAR’18, Lecture Notes in Computer Science, Didier Galmiche, Stephan Schulz, and Roberto Sebastiani (Eds.), Vol. 10900. Springer, Berlin, 680--688.Google Scholar
- Yujiao Zhou, Bernardo Cuenca Grau, Yavor Nenov, Mark Kaminski, and Ian Horrocks. 2015. PAGOdA: Pay-as-you-go ontology query answering using a Datalog reasoner. Journal of Artificial Intelligence Research 54 (2015), 309--367. Google ScholarDigital Library
Index Terms
- Fast Query Answering over Existential Rules
Recommendations
Chase Termination for Guarded Existential Rules
PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsThe chase procedure is considered as one of the most fundamental algorithmic tools in database theory. It has been successfully applied to different database problems such as data exchange, and query answering and containment under constraints, to name ...
Query Optimization for Ontology-Mediated Query Answering
WWW '24: Proceedings of the ACM on Web Conference 2024Ontology-mediated query answering (OMQA) consists in asking database queries on knowledge bases (KBs); a KB is a set of facts called the KB's database, which is described by domain knowledge called the KB's ontology. A widely-investigated OMQA technique ...
Polynomial combined first-order rewritings for linear and guarded existential rules
AbstractWe consider the problem of ontological query answering, that is, the problem of answering a database query (typically a conjunctive query) in the presence of an ontology. This means that during the query answering process we also need ...
Comments