{"type":"ScholarlyArticle","title":"Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward","authors":[{"name":"Giovanni Amendola","slug":"giovanni-amendola","given":"Giovanni","family":"Amendola","affiliation":"University of Calabria"},{"name":"Nicola Leone","slug":"nicola-leone","given":"Nicola","family":"Leone","affiliation":"University of Calabria"},{"name":"Marco Manna","slug":"marco-manna","given":"Marco","family":"Manna","affiliation":"University of Calabria"}],"abstract":"Reasoning with existential rules typically consists of checking whether a Boolean conjunctive query is satisfied by all models of a first-order sentence having the form of a conjunction of Datalog rules extended with existential quantifiers in rule-heads. To guarantee decidability, five basic decidable classes - linear, weakly-acyclic, guarded, sticky, and shy - have been singled out, together with several generalizations and combinations. For all basic classes, except shy, the important property of finite controllability has been proved, ensuring that a query is satisfied by all models of the sentence if, and only if, it is satisfied by all of its finite models. This paper takes two steps forward: (i) devise a general technique to facilitate the process of (dis)proving finite controllability of an arbitrary class of existential rules; and (ii) specialize the technique to complete the picture for the five mentioned classes, by showing that also shy is finitely controllable.","doi":"10.24963/ijcai.2018/719","url":"https://ijcai.org/proceedings/2018/719","pdf":"https://ijcai.org/proceedings/2018/0719.pdf","markdown":"https://ijcai.org/proceedings/2018/719.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/719","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Sister Conferences Best Papers","track":"Best Sister Conferences","number":719,"pages":{"first":5189,"last":5193},"keywords":["Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[],"references":[{"position":1,"raw":"[Alviano and Pieris, 2015] Mario Alviano and Andreas Pieris. Default negation for non-guarded existential rules. In Proc. of PODS, pages 91-103, 2015.","title":"Default negation for non-guarded existential rules","authors":"Pieris Alviano, Mario Alviano, Andreas Pieris","year":"2015","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amendola et al., 2017] Giovanni Amendola, Nicola Leone, and Marco Manna. Finite model reasoning over existential rules. TPLP, 17(5-6):726-743, 2017.","title":"Finite model reasoning over existential rules","authors":"Giovanni Amendola, Nicola Leone, Marco Manna","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Amendola et al., 2018] Giovanni Amendola, Nicola Leone, Marco Manna, and Pierfrancesco Veltri. Enhancing exis- tential rules by closed-world variables. In Proc. of IJCAI, 2018.","title":"Enhancing existential rules by closed-world variables","authors":"Giovanni Amendola, Nicola Leone, Marco Manna, Pierfrancesco Veltri","year":"2018","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/232"},{"position":4,"raw":"[Baader et al., 2002] Franz Baader, Ian Horrocks, and Ul- rike Sattler. Description logics for the semantic web. KI, 16(4):57-59, 2002.","title":"Description logics for the semantic web","authors":"Baader","year":"2002","venue":"KI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baget et al., 2010] Jean-Franc ¸ois Baget, Michel Leclère, and Marie-Laure Mugnier. Walking the decidability line for rules with existential variables. In Proc. of KR, 2010.","title":"Walking the decidability line for rules with existential variables","authors":"Baget","year":"2010","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Baget et al., 2011] Jean-Franc ¸ois Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. On rules with exis- tential variables: Walking the decidability line. AIJ, 175(9- 10):1620-1654, 2011.","title":"On rules with existential variables: Walking the decidability line","authors":"Baget","year":"2011","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bárány et al., 2014] Vince Bárány, Georg Gottlob, and Mar- tin Otto. Querying the guarded fragment. Log. Methods Comput. Sci., 10(2), 2014.","title":"Querying the guarded fragment","authors":"Vince Bárány, Georg Gottlob, Martin Otto","year":"2014","venue":"Log. Methods Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Beeri and Vardi, 1984] Catriel Beeri and Moshe Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718-741, 1984.","title":"A proof procedure for data dependencies","authors":"Catriel Beeri, Moshe Y Vardi","year":"1984","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bienvenu et al., 2014] Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data ac- cess: A study through disjunctive datalog, csp, and MM- SNP. ACM TODS, 39(4):33:1-33:44, 2014.","title":"Ontology-based data access: A study through disjunctive datalog, csp, and MM-SNP","authors":"Bienvenu","year":"2014","venue":"ACM TODS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calì et al., 2009a] Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. Datalog ± : a unified approach to ontologies and integrity constraints. In Proc. of ICDT, pages 14-30, 2009.","title":"Datalog ± : a unified approach to ontologies and integrity constraints","authors":"Calì","year":"2009","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Calì et al., 2009b] Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, pages 77-86, 2009.","title":"A general datalog-based framework for tractable query answering over ontologies","authors":"Calì","year":"2009","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Calì et al., 2010] Andrea Calì, Georg Gottlob, and Andreas Pieris. Advanced processing for ontological queries. PVLDB, 3(1):554-565, 2010.","title":"Advanced processing for ontological queries","authors":"Andrea Calì, Georg Gottlob, Andreas Pieris","year":"2010","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Calì et al., 2012] Andrea Calì, Georg Gottlob, and Andreas Pieris. Towards more expressive ontology languages: The query answering problem. AIJ, 193:87-128, 2012.","title":"Towards more expressive ontology languages: The query answering problem","authors":"Andrea Calì, Georg Gottlob, Andreas Pieris","year":"2012","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Calì et al., 2013] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive relational constraints. JAIR, 48:115-174, 2013.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"Andrea Calì, Georg Gottlob, Michael Kifer","year":"2013","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Calvanese et al., 2013] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. Data complexity of query answering in de- scription logics. AIJ, 195:335-360, 2013.","title":"Data complexity of query answering in description logics","authors":"Calvanese","year":"2013","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fages, 1991] Franc ¸ois Fages. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Comput., 9(3/4):425-444, 1991.","title":"Franc ¸ois Fages. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics","authors":"Fages","year":"1991","venue":"New Generation Comput","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fagin et al., 2005] Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: se- mantics and query answering. TCS, 336(1):89-124, 2005.","title":"Data exchange: semantics and query answering","authors":"Ronald Fagin, G Phokion, Renée J Kolaitis, Lucian Miller, Popa","year":"2005","venue":"TCS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gogacz and Marcinkowski, 2017] Tomasz Gogacz and Jerzy Marcinkowski. Converging to the chase -A tool for finite controllability. JCSS, 83(1):180-206, 2017.","title":"Tomasz Gogacz and Jerzy Marcinkowski. Converging to the chase -A tool for finite controllability","authors":"Marcinkowski Gogacz","year":"2017","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gottlob et al., 2013] Georg Gottlob, Marco Manna, and An- dreas Pieris. Combining decidability paradigms for exis- tential rules. TPLP, 13(4-5):877-892, 2013.","title":"Combining decidability paradigms for existential rules","authors":"Gottlob","year":"2013","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gottlob et al., 2014] Georg Gottlob, Stanislav Kikot, Ro- man Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, and Michael Zakharyaschev. The price of query rewriting in ontology-based data access. AIJ, 213:42-59, 2014.","title":"The price of query rewriting in ontology-based data access","authors":"Gottlob","year":"2014","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gottlob et al., 2018] Georg Gottlob, Marco Manna, and An- dreas Pieris. Finite model reasoning in hybrid classes of existential rules. In Proc. of IJCAI, 2018.","title":"Finite model reasoning in hybrid classes of existential rules","authors":"Gottlob","year":"2018","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/253"},{"position":22,"raw":"[Ibáñez-García et al., 2014] Yazmin Angélica Ibáñez- García, Carsten Lutz, and Thomas Schneider. Finite model reasoning in horn description logics. In Proc. of KR, 2014.","title":"Finite model reasoning in horn description logics","authors":"Yazmin Angélica Ibáñez-García, Carsten Lutz, Thomas Schneider","year":"2014","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Johnson and Klug, 1984] David S. Johnson and Anthony C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. JCSS, 28(1):167- 189, 1984.","title":"Testing containment of conjunctive queries under functional and inclusion dependencies","authors":"David S Johnson, Anthony C Klug","year":"1984","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Krötzsch and Rudolph, 2011] Markus Krötzsch and Sebast- ian Rudolph. Extending decidable existential rules by join- ing acyclicity and guardedness. In Proc. of IJCAI, pages 963-968, 2011.","title":"Extending decidable existential rules by joining acyclicity and guardedness","authors":"Rudolph ; Krötzsch, Markus Krötzsch, Sebastian Rudolph","year":"2011","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/166"},{"position":25,"raw":"[Leone et al., 2012] Nicola Leone, Marco Manna, Giorgio Terracina, and Pierfrancesco Veltri. Efficiently com- putable Datalog ∃ programs. In Proc. of KR, 2012.","title":"Efficiently computable Datalog ∃ programs","authors":"Nicola Leone, Marco Manna, Giorgio Terracina, Pierfrancesco Veltri","year":"2012","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pérez-Urbina et al., 2010] Héctor Pérez-Urbina, Boris Motik, and Ian Horrocks. Tractable query answering and rewriting under description logic constraints. J. Appl. Logic, pages 186-209, 2010.","title":"Tractable query answering and rewriting under description logic constraints","authors":"Héctor Pérez-Urbina, Boris Motik, Ian Horrocks","year":"2010","venue":"J. Appl. Logic","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Rosati, 2006] Riccardo Rosati. On the decidability and fi- nite controllability of query processing in databases with incomplete information. In Proc. of PODS, pages 356- 365, 2006.","title":"On the decidability and finite controllability of query processing in databases with incomplete information","authors":"Riccardo Rosati","year":"2006","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Rosati, 2007] Riccardo Rosati. The limits of querying on- tologies. In Proc. of ICDT, pages 164-178, 2007.","title":"The limits of querying ontologies","authors":"Riccardo Rosati","year":"2007","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Rosati, 2008] Riccardo Rosati. Finite model reasoning in dl-lite. In Proc. of ESWC, pages 215-229, 2008.","title":"Finite model reasoning in dl-lite","authors":"Riccardo Rosati","year":"2008","venue":"Proc. of ESWC","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}