{"type":"ScholarlyArticle","title":"Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract)","authors":[{"name":"Camille Bourgaux","slug":"camille-bourgaux","given":"Camille","family":"Bourgaux","affiliation":"DI ENS , ENS , CNRS , PSL University & Inria , Paris , France"},{"name":"David Carral","slug":"david-carral","given":"David","family":"Carral","affiliation":"LIRMM , Inria , University of Montpellier , CNRS , Montpellier , France"},{"name":"Markus Krötzsch","slug":"markus-krotzsch","given":"Markus","family":"Krötzsch","affiliation":"Technische Universität Dresden , Dresden , Germany"},{"name":"Sebastian Rudolph","slug":"sebastian-rudolph","given":"Sebastian","family":"Rudolph","affiliation":"Technische Universität Dresden , Dresden , Germany"},{"name":"Michaël Thomazo","slug":"michael-thomazo","given":"Michael","family":"Thomazo","affiliation":"DI ENS , ENS , CNRS , PSL University & Inria , Paris , France"}],"abstract":"Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable and can only recognize properties that are preserved under homomorphisms. \r\nThis paper is an extended abstract of our eponymous publication at KR 2021 where we show the converse: every decidable query that is closed under homomorphism can be expressed by an existential rule set for which the standard chase universally terminates. Membership in this fragment is not decidable, but we show via a diagonalisation argument that this is unavoidable.","doi":"10.24963/ijcai.2022/733","url":"https://ijcai.org/proceedings/2022/733","pdf":"https://ijcai.org/proceedings/2022/0733.pdf","markdown":"https://ijcai.org/proceedings/2022/733.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/733","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":733,"pages":{"first":5269,"last":5273},"keywords":["Artificial Intelligence: General"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987267","length_sec":121,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985410","length_sec":880,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Abiteboul et al., 1995] Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.","title":"Foundations of Databases","authors":"Serge Abiteboul, Richard Hull, Victor Vianu","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baget et al., 2011a] Jean-Franc ¸ois Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. On rules with ex- istential variables: Walking the decidability line. Artif. In- tell., 175(9-10):1620-1654, 2011.","title":"On rules with existential variables: Walking the decidability line","authors":"Baget","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baget et al., 2011b] Jean-Franc ¸ois Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Michaël Thomazo. Walking the complexity lines for generalized guarded existential rules. In Walsh [2011], pages 712-717.","title":"Walking the complexity lines for generalized guarded existential rules","authors":"Baget","year":"2011","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2011/126"},{"position":4,"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":5,"raw":"[Bourgaux et al., 2021] Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, and Michaël Thomazo. Capturing homomorphism-closed decidable queries with existential rules. In Meghyn Bienvenu, Ger- hard Lakemeyer, and Esra Erdem, editors, Proceedings of the 18th International Conference on Principles of Knowl- edge Representation and Reasoning (KR 2021), pages 141-150, 2021.","title":"Capturing homomorphism-closed decidable queries with existential rules","authors":"Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo","year":"2021","venue":"Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cabibbo, 1998] Luca Cabibbo. The expressive power of stratified logic programs with value invention. Inf. Com- put., 147(1):22-56, 1998.","title":"The expressive power of stratified logic programs with value invention","authors":"Luca Cabibbo","year":"1998","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Calì et al., 2008] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering un- der expressive relational constraints. In Gerhard Brewka and Jérôme Lang, editors, Proc. 11th Int. Conf. on Knowl- edge Representation and Reasoning (KR'08), pages 70- 80. AAAI Press, 2008.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"Andrea Calì, Georg Gottlob, Michael Kifer","year":"2008","venue":"Proc. 11th Int. Conf. on Knowledge Representation and Reasoning (KR'08)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Carral et al., 2017] David Carral, Irina Dragoste, and Markus Krötzsch. Restricted chase (non)termination for existential rules with disjunctions. In Carles Sierra, edi- tor, Proc. 26th Int. Joint Conf. on Artificial Intelligence, IJCAI'17, pages 922-928. ijcai.org, 2017.","title":"Restricted chase (non)termination for existential rules with disjunctions","authors":"David Carral, Irina Dragoste, Markus Krötzsch","year":"2017","venue":"Carles Sierra, editor, Proc. 26th Int. Joint Conf. on Artificial Intelligence, IJCAI'17","doi":null,"url":null,"internal_url":"/proceedings/2017/128"},{"position":9,"raw":"[Deutsch et al., 2008] Alin Deutsch, Alan Nash, and Jef- frey B. Remmel. The chase revisited. In Maurizio Lenz- erini and Domenico Lembo, editors, Proc. 27th Sympo- sium on Principles of Database Systems (PODS'08), pages 149-158. ACM, 2008. Fagin et al., 2005]","title":"The chase revisited","authors":"Alin Deutsch, Alan Nash, Jeffrey B Remmel","year":"2005","venue":"Proc. 27th Symposium on Principles of Database Systems (PODS'08)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: seman- tics and query answering. Theoretical Computer Science, 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":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Grahne and Onet, 2018] Gösta Grahne and Adrian Onet. Anatomy of the chase. Fundam. Informaticae, 157(3):221-270, 2018.","title":"Gösta Grahne and Adrian Onet. Anatomy of the chase","authors":"Onet Grahne","year":"2018","venue":"Fundam. Informaticae","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Krötzsch and Rudolph, 2011] Markus Krötzsch and Sebas- tian Rudolph. Extending decidable existential rules by joining acyclicity and guardedness. In Walsh [2011], pages 963-968.","title":"Extending decidable existential rules by joining acyclicity and guardedness","authors":"Rudolph ; Krötzsch, Markus Krötzsch, Sebastian Rudolph","year":"2011","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2011/166"},{"position":13,"raw":"[Krötzsch et al., 2019] Markus Krötzsch, Maximilian Marx, and Sebastian Rudolph. The power of the terminating chase. In Pablo Barceló and Marco Calautti, editors, Proc. 22nd Int. Conf. on Database Theory, ICDT'19, vol- ume 127 of LIPIcs, pages 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","title":"The power of the terminating chase","authors":"Krötzsch","year":"2019","venue":"Proc. 22nd Int. Conf. on Database Theory, ICDT'19","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Marnette, 2009] Bruno Marnette. Generalized schema- mappings: from termination to tractability. In Jan Paredaens and Jianwen Su, editors, Proc. 28th Symposium on Principles of Database Systems (PODS'09), pages 13- 22. ACM, 2009.","title":"Generalized schemamappings: from termination to tractability","authors":"Bruno Marnette","year":"2009","venue":"Proc. 28th Symposium on Principles of Database Systems (PODS'09)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Rudolph and Thomazo, 2015] Sebastian Rudolph and Michaël Thomazo. Characterization of the expressivity of existential rule queries. In Qiang Yang and Michael Wooldridge, editors, Proc. 24th Int. Joint Conf. on Arti- ficial Intelligence (IJCAI'15), pages 3193-3199. AAAI Press, 2015.","title":"Characterization of the expressivity of existential rule queries","authors":"Rudolph, Thomazo, Sebastian Rudolph, Michaël Thomazo","year":"2015","venue":"Proc. 24th Int. Joint Conf. on Artificial Intelligence (IJCAI'15)","doi":null,"url":null,"internal_url":"/proceedings/2015/450"},{"position":16,"raw":"[Walsh, 2011] Toby Walsh, editor. Proc. 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI'11). AAAI Press/IJCAI, 2011.","title":"Proc. 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI'11). AAAI Press/IJCAI","authors":null,"year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Zhang et al., 2015] Heng Zhang, Yan Zhang, and Jia-Huai You. Existential rule languages with finite chase: Com- plexity and expressiveness. In Blai Bonet and Sven Koenig, editors, Proc. 29th AAAI Conf. on Artificial In- telligence (AAAI'15). AAAI Press, 2015.","title":"Existential rule languages with finite chase: Complexity and expressiveness","authors":"Heng Zhang, Yan Zhang, Jia-Huai You","year":"2015","venue":"Proc. 29th AAAI Conf. on Artificial Intelligence (AAAI'15)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}