{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:56:13Z","timestamp":1759683373578,"version":"3.41.0"},"reference-count":80,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:00:00Z","timestamp":1553644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Italian Ministry for Economic Development under PON project \u201dS2BDW\u201e","award":["F\/050389\/01-03\/X32"],"award-info":[{"award-number":["F\/050389\/01-03\/X32"]}]},{"name":"Regione Calabria under POR project \u201dDLV Large Scale\u201e","award":["CUPJ28C17000220006"],"award-info":[{"award-number":["CUPJ28C17000220006"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2019,4,30]]},"abstract":"<jats:p>\n            Enhancing Datalog with existential quantification gives rise to Datalog\n            <jats:sup>\u2203<\/jats:sup>\n            , a powerful knowledge representation language widely used in ontology-based query answering. In this setting, a conjunctive query is evaluated over a Datalog\n            <jats:sup>\u2203<\/jats:sup>\n            program consisting of extensional data paired with so-called \u201cexistential\u201d 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\n            <jats:sup>\u2203<\/jats:sup>\n            , an effective system for query answering over parsimonious existential rules. To assess its efficiency, we carry out an experimental analysis, evaluating DLV\n            <jats:sup>\u2203<\/jats:sup>\n            performances for ontology-based query answering on both real-world and synthetic ontologies.\n          <\/jats:p>","DOI":"10.1145\/3308448","type":"journal-article","created":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:23:24Z","timestamp":1553775804000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Fast Query Answering over Existential Rules"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9742-1252","authenticated-orcid":false,"given":"Nicola","family":"Leone","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Calabria, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3323-9328","authenticated-orcid":false,"given":"Marco","family":"Manna","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Calabria, Italy"}]},{"given":"Giorgio","family":"Terracina","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Calabria, Italy"}]},{"given":"Pierfrancesco","family":"Veltri","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Calabria, Italy"}]}],"member":"320","published-online":{"date-parts":[[2019,3,27]]},"reference":[{"volume-title":"Foundations of Databases: The Logical Level","author":"Abiteboul Serge","key":"e_1_2_1_1_1","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases: The Logical Level . Addison-Wesley Longman Publishing Co., Inc. Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases: The Logical Level. Addison-Wesley Longman Publishing Co., Inc."},{"key":"e_1_2_1_2_1","volume-title":"Domenico Lembo, Maurizio Lenzerini, Mattia Palmieri, and Riccardo Rosati.","author":"Acciarri Andrea","year":"2005","unstructured":"Andrea Acciarri , Diego Calvanese , Giuseppe De Giacomo , Domenico Lembo, Maurizio Lenzerini, Mattia Palmieri, and Riccardo Rosati. 2005 . QUONTO : Querying ontologies. In Proceedings of AAAI\u201905, Vol. 4 . AAAI Press , 1670--1671. Andrea Acciarri, Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Mattia Palmieri, and Riccardo Rosati. 2005. QUONTO: Querying ontologies. In Proceedings of AAAI\u201905, Vol. 4. AAAI Press, 1670--1671."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000257"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034794"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745758"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734953.1734954"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of IJCAI\u201905","author":"Baader Franz","year":"2005","unstructured":"Franz Baader , Sebastian Brandt , and Carsten Lutz . 2005 . Pushing the EL envelope . In Proceedings of IJCAI\u201905 . AAAI Press, 364--369. Franz Baader, Sebastian Brandt, and Carsten Lutz. 2005. Pushing the EL envelope. In Proceedings of IJCAI\u201905. AAAI Press, 364--369."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.002"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of IJCAI\u201911","author":"Baget Jean-Fran\u00e7ois","year":"2011","unstructured":"Jean-Fran\u00e7ois Baget , Marie-Laure Mugnier , Sebastian Rudolph , and Micha\u00ebl Thomazo . 2011 . Walking the complexity lines for generalized guarded existential rules . In Proceedings of IJCAI\u201911 . AAAI Press, 712--717. Jean-Fran\u00e7ois Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Micha\u00ebl Thomazo. 2011. Walking the complexity lines for generalized guarded existential rules. In Proceedings of IJCAI\u201911. AAAI Press, 712--717."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of KR\u201910","author":"Baget Jean-Fran\u00e7ois","year":"2010","unstructured":"Jean-Fran\u00e7ois Baget , Michel Lecl\u00e8re , and Marie-Laure Mugnier . 2010 . Walking the decidability line for rules with existential variables . In Proceedings of KR\u201910 . AAAI Press, 466--476. Jean-Fran\u00e7ois Baget, Michel Lecl\u00e8re, and Marie-Laure Mugnier. 2010. Walking the decidability line for rules with existential variables. In Proceedings of KR\u201910. AAAI Press, 466--476."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21542-6_21"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of IJCAI\u201909","author":"Baget Jean-Fran\u00e7ois","year":"2009","unstructured":"Jean-Fran\u00e7ois Baget , Michel Lecl\u00e8re , Marie-Laure Mugnier , and Eric Salvat . 2009 . Extending decidable cases for rules with existential variables . In Proceedings of IJCAI\u201909 . AAAI Press, 677--682. Jean-Fran\u00e7ois Baget, Michel Lecl\u00e8re, Marie-Laure Mugnier, and Eric Salvat. 2009. Extending decidable cases for rules with existential variables. In Proceedings of IJCAI\u201909. AAAI Press, 677--682."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(2:3)2014"},{"key":"e_1_2_1_14_1","volume-title":"Vardi","author":"Beeri Catriel","year":"1981","unstructured":"Catriel Beeri and Moshe Y . Vardi . 1981 . The implication problem for data dependencies. In Proceedings of ICALP\u201981. Springer , 73--85. Catriel Beeri and Moshe Y. Vardi. 1981. The implication problem for data dependencies. In Proceedings of ICALP\u201981. Springer, 73--85."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213888"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034796"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661643"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2019470.2019472"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976736"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3171642.3171768"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of PAIS\u201904","author":"Brandt Sebastian","year":"2004","unstructured":"Sebastian Brandt . 2004 . Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In Proceedings of PAIS\u201904 . IOS Press, 298--302. Sebastian Brandt. 2004. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In Proceedings of PAIS\u201904. IOS Press, 298--302."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of KR\u201908","author":"Cal\u00ec Andrea","year":"2008","unstructured":"Andrea Cal\u00ec , Georg Gottlob , and Michael Kifer . 2008 . Taming the infinite chase: Query answering under expressive relational constraints . In Proceedings of KR\u201908 . AAAI Press, 70--80. Andrea Cal\u00ec, Georg Gottlob, and Michael Kifer. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proceedings of KR\u201908. AAAI Press, 70--80."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591248.2591252"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559809"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514897"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of DL Workshop","author":"Cal\u00ec Andrea","year":"2009","unstructured":"Andrea Cal\u00ec , Georg Gottlob , and Thomas Lukasiewicz . 2009 . Tractable query answering over ontologies with Datalog+\/- . In Proceedings of DL Workshop 2009. 1--12. Andrea Cal\u00ec, Georg Gottlob, and Thomas Lukasiewicz. 2009. Tractable query answering over ontologies with Datalog+\/-. In Proceedings of DL Workshop 2009. 1--12."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2012.03.001"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920912"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1894568.1894570"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.002"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of AAAI\u201910","author":"Calimeri Francesco","year":"2010","unstructured":"Francesco Calimeri , Susanna Cozza , Giovambattista Ianni , and Nicola Leone . 2010 . Enhancing ASP by functions: Decidable classes and implementation techniques . In Proceedings of AAAI\u201910 . AAAI Press, 1666--1670. Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, and Nicola Leone. 2010. Enhancing ASP by functions: Decidable classes and implementation techniques. In Proceedings of AAAI\u201910. AAAI Press, 1666--1670."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-160217"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9078-x"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.10.003"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2019470.2019475"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032266.2032282"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32925-8_8"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387915.2387927"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27775-0_26"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376938"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of AAAI\u201912","author":"Eiter Thomas","year":"2012","unstructured":"Thomas Eiter , Magdalena Ortiz , Mantas Simkus , Trung-Kien Tran , and Guohui Xiao . 2012 . Query rewriting for Horn-SHIQ plus rules . In Proceedings of AAAI\u201912 . AAAI Press, 726--733. Thomas Eiter, Magdalena Ortiz, Mantas Simkus, Trung-Kien Tran, and Guohui Xiao. 2012. Query rewriting for Horn-SHIQ plus rules. In Proceedings of AAAI\u201912. AAAI Press, 726--733."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1085304.1085309"},{"volume-title":"Proceedings of SEBD\u201913","author":"Febbraro O.","key":"e_1_2_1_44_1","unstructured":"O. Febbraro , N. Leone , F. Ricca , G. Terracina , and P. Veltri . 2013. A graphic tool for ontology reasoning under Datalog<sup>&exist;<\/sup> . In Proceedings of SEBD\u201913 . Curran Associates, 51--62. O. Febbraro, N. Leone, F. Ricca, G. Terracina, and P. Veltri. 2013. A graphic tool for ontology reasoning under Datalog<sup>&exist;<\/sup>. In Proceedings of SEBD\u201913. Curran Associates, 51--62."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622655.1622660"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.61"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of KR\u201914","author":"Gottlob Georg","year":"2014","unstructured":"Georg Gottlob , Andr\u00e9 Hernich , Clemens Kupke , and Thomas Lukasiewicz . 2014 . Stable model semantics for guarded existential rules and description logics . In Proceedings of KR\u201914 . 258--267. Georg Gottlob, Andr\u00e9 Hernich, Clemens Kupke, and Thomas Lukasiewicz. 2014. Stable model semantics for guarded existential rules and description logics. In Proceedings of KR\u201914. 258--267."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.04.004"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000550"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2638546"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_27"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2566972.2566991"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402750"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"volume-title":"Proceedings of IJCAR\u201901","author":"Haarslev V.","key":"e_1_2_1_55_1","unstructured":"V. Haarslev and R. M\u00f6ller . 2001. RACER system description . In Proceedings of IJCAR\u201901 . Springer, 701--705. V. Haarslev and R. M\u00f6ller. 2001. RACER system description. In Proceedings of IJCAR\u201901. Springer, 701--705."},{"volume-title":"Proceedings of KR\u201904","author":"Hustadt U.","key":"e_1_2_1_56_1","unstructured":"U. Hustadt , B. Motik , and U. Sattler . 2004. Reducing SHIQ-description logic to disjunctive Datalog programs . In Proceedings of KR\u201904 . AAAI Press, 152--162. U. Hustadt, B. Motik, and U. Sattler. 2004. Reducing SHIQ-description logic to disjunctive Datalog programs. In Proceedings of KR\u201904. AAAI Press, 152--162."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"volume-title":"Lecture Notes in Computer Science","author":"Kloks Ton","key":"e_1_2_1_58_1","unstructured":"Ton Kloks . 1994. Treewidth, Computations and Approximations , Lecture Notes in Computer Science , Vol. 842 . Springer , Berlin . Ton Kloks. 1994. Treewidth, Computations and Approximations, Lecture Notes in Computer Science, Vol. 842. Springer, Berlin."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of IJCAI\u201915","author":"K\u00f6nig M\u00e9lanie","year":"2015","unstructured":"M\u00e9lanie K\u00f6nig , Michel Leclere , and Marie-Laure Mugnier . 2015 . Query rewriting for existential rules with compiled preorder . In Proceedings of IJCAI\u201915 . AAAI Press, 3106--3112. M\u00e9lanie K\u00f6nig, Michel Leclere, and Marie-Laure Mugnier. 2015. Query rewriting for existential rules with compiled preorder. In Proceedings of IJCAI\u201915. AAAI Press, 3106--3112."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of IJCAI\u201911","author":"Kr\u00f6tzsch Markus","year":"2011","unstructured":"Markus Kr\u00f6tzsch and Sebastian Rudolph . 2011 . Extending decidable existential rules by joining acyclicity and guardedness . In Proceedings of IJCAI\u201911 . AAAI Press, 963--968. Markus Kr\u00f6tzsch and Sebastian Rudolph. 2011. Extending decidable existential rules by joining acyclicity and guardedness. In Proceedings of IJCAI\u201911. AAAI Press, 963--968."},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of KR\u201912","author":"Leone Nicola","year":"2012","unstructured":"Nicola Leone , Marco Manna , Giorgio Terracina , and Pierfrancesco Veltri . 2012 . Efficiently computable Datalog<sup>&exist;<\/sup> programs . In Proceedings of KR\u201912 . AAAI Press, 13--23. Nicola Leone, Marco Manna, Giorgio Terracina, and Pierfrancesco Veltri. 2012. Efficiently computable Datalog<sup>&exist;<\/sup> programs. In Proceedings of KR\u201912. AAAI Press, 13--23."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41335-3_20"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559799"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687737"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734953.1734957"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.5555\/2036949.2036951"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_31"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2009.09.004"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of AMW\u201911","volume":"477","author":"Rodriguez-Muro Mariano","year":"2011","unstructured":"Mariano Rodriguez-Muro and Diego Calvanese . 2011 . Dependencies: Making ontology based data access work in practice . In Proceedings of AMW\u201911 , Vol. 477 . CEUR-WS.org, 1--12. Mariano Rodriguez-Muro and Diego Calvanese. 2011. Dependencies: Making ontology based data access work in practice. In Proceedings of AMW\u201911, Vol. 477. CEUR-WS.org, 1--12."},{"key":"e_1_2_1_72_1","volume-title":"Proceedings of DL Workshop\u201911","volume":"745","author":"Rodriguez-Muro Mariano","year":"2011","unstructured":"Mariano Rodriguez-Muro and Diego Calvanese . 2011 . Dependencies to optimize ontology based data access . In Proceedings of DL Workshop\u201911 , Vol. 745 . CEUR-WS.org, 1--11. Mariano Rodriguez-Muro and Diego Calvanese. 2011. Dependencies to optimize ontology based data access. In Proceedings of DL Workshop\u201911, Vol. 745. CEUR-WS.org, 1--11."},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of DL Workshop\u201907","author":"Rosati Riccardo","year":"2007","unstructured":"Riccardo Rosati . 2007 . On conjunctive query answering in EL . In Proceedings of DL Workshop\u201907 . 1--8. Riccardo Rosati. 2007. On conjunctive query answering in EL. In Proceedings of DL Workshop\u201907. 1--8."},{"volume-title":"Proceedings of KR\u201910","author":"Rosati R.","key":"e_1_2_1_74_1","unstructured":"R. Rosati and A. Almatelli . 2010. Improving query answering over DL-Lite ontologies . In Proceedings of KR\u201910 . AAAI Press, 290--300. R. Rosati and A. Almatelli. 2010. Improving query answering over DL-Lite ontologies. In Proceedings of KR\u201910. AAAI Press, 290--300."},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of DL Workshop\u201908","volume":"353","author":"Rudolph Sebastian","year":"2008","unstructured":"Sebastian Rudolph , Markus Kr\u00f6tzsch , and Pascal Hitzler . 2008 . All Elephants are bigger than all mice . In Proceedings of DL Workshop\u201908 , Vol. 353 . CEUR-WS.org, 1--11. Sebastian Rudolph, Markus Kr\u00f6tzsch, and Pascal Hitzler. 2008. All Elephants are bigger than all mice. In Proceedings of DL Workshop\u201908, Vol. 353. CEUR-WS.org, 1--11."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2007.03.004"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2015.02.001"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_26"},{"key":"e_1_2_1_79_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of IJCAR\u201918","author":"Urbani Jacopo","unstructured":"Jacopo Urbani , Markus Kr\u00f6tzsch , Ceriel J. H. Jacobs , Irina Dragoste , and David Carral . 2018. Efficient model construction for horn logic with VLog\u2014system description . In Proceedings of IJCAR\u201918 , Lecture Notes in Computer Science , Didier Galmiche, Stephan Schulz, and Roberto Sebastiani (Eds.), Vol. 10900 . Springer , Berlin , 680--688. Jacopo Urbani, Markus Kr\u00f6tzsch, Ceriel J. H. Jacobs, Irina Dragoste, and David Carral. 2018. Efficient model construction for horn logic with VLog\u2014system description. In Proceedings of IJCAR\u201918, Lecture Notes in Computer Science, Didier Galmiche, Stephan Schulz, and Roberto Sebastiani (Eds.), Vol. 10900. Springer, Berlin, 680--688."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.5555\/2910557.2910566"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308448","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:36Z","timestamp":1750204476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,27]]},"references-count":80,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4,30]]}},"alternative-id":["10.1145\/3308448"],"URL":"https:\/\/doi.org\/10.1145\/3308448","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2019,3,27]]},"assertion":[{"value":"2017-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}