{"type":"ScholarlyArticle","title":"Oblivious and Semi-Oblivious Boundedness for Existential Rules","authors":[{"name":"Pierre Bourhis","slug":"pierre-bourhis","given":"Pierre","family":"Bourhis","affiliation":"CNRS , France; Univ. Lille , CRIStAL , France; Inria , France"},{"name":"Michel Leclère","slug":"michel-leclere","given":"Michel","family":"Leclère","affiliation":"Univ. Montpellier , LIRMM , France; Inria , France"},{"name":"Marie-Laure Mugnier","slug":"marie-laure-mugnier","given":"Marie-Laure","family":"Mugnier","affiliation":"Univ. Montpellier , LIRMM , France; Inria , France"},{"name":"Sophie Tison","slug":"sophie-tison","given":"Sophie","family":"Tison","affiliation":"Univ. Lille , CRIStAL , France; Inria , France"},{"name":"Federico Ulliana","slug":"federico-ulliana","given":"Federico","family":"Ulliana","affiliation":"Univ. Montpellier , LIRMM , France; Inria , France"},{"name":"Lily Gallois","slug":"lily-gallois","given":"Lily","family":"Gallois","affiliation":"Univ. Lille , CRIStAL , France; Inria , France"}],"abstract":"We study the notion of boundedness in the context positive existential rules, that is, wether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO-rewritability and chase termination. We show that it is decidable to recognize if a set of rules is bounded for several classes of rules and outline the complexity of the problem.","doi":"10.24963/ijcai.2019/219","url":"https://ijcai.org/proceedings/2019/219","pdf":"https://ijcai.org/proceedings/2019/0219.pdf","markdown":"https://ijcai.org/proceedings/2019/219.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/219","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":219,"pages":{"first":1581,"last":1587},"keywords":["Knowledge Representation and Reasoning: Knowledge Representation Languages","Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving","Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"[Ajtai and Gurevich, 1994] Miklos Ajtai and Yuri Gurevich. Datalog vs first-order logic. 1994.","title":"Datalog vs first-order logic","authors":"Gurevich Ajtai, Miklos Ajtai, Yuri Gurevich","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baget et al., 2011] 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":"[Barceló et al., 2018] Pablo Barceló, Gerald Berger, Carsten Lutz, and Andreas Pieris. First-order rewritability of frontier-guarded ontology-mediated queries. In Proceed- ings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden., pages 1707-1713, 2018.","title":"First-order rewritability of frontier-guarded ontology-mediated queries","authors":"Barceló","year":"2018","venue":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018","doi":null,"url":null,"internal_url":"/proceedings/2018/236"},{"position":4,"raw":"[Benedikt and Gottlob, 2010] Michael Benedikt and Georg Gottlob. The impact of virtual views on containment. PVLDB, 3(1):297-308, 2010.","title":"The impact of virtual views on containment","authors":"Michael Benedikt, Georg Gottlob","year":"2010","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calautti and Pieris, 2019] Marco Calautti and Andreas Pieris. Oblivious chase termination: The sticky case. In 22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal, pages 17:1-17:18, 2019.","title":"Oblivious chase termination: The sticky case","authors":"Pieris Calautti, Marco Calautti, Andreas Pieris","year":"2019","venue":"22nd International Conference on Database Theory, ICDT 2019","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Calautti et al., 2015] Marco Calautti, Georg Gottlob, and Andreas Pieris. Chase termination for guarded existen- tial rules. In Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 -June 4, 2015, pages 91-103, 2015.","title":"Chase termination for guarded existential rules","authors":"Marco Calautti, Georg Gottlob, Andreas Pieris","year":"2015","venue":"Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Calì et al., 2009] Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. Datalog extensions for tractable query an- swering over ontologies. In Semantic Web Information Management -A Model-Based Perspective, pages 249- 279. 2009.","title":"Datalog extensions for tractable query answering over ontologies","authors":"Andrea Calì, Georg Gottlob, Thomas Lukasiewicz","year":"2009","venue":"Semantic Web Information Management -A Model-Based Perspective","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Calì et al., 2013] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering un- der expressive relational constraints. J. Artif. Intell. Res., 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":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calvanese et al., 2007] Diego Calvanese, Giuseppe De Gi- acomo, Domenico Lembo, Maurizio Lenzerini, and Ric- cardo Rosati. Tractable reasoning and efficient query an- swering in description logics: The DL-Lite family. J. Au- tom. Reasoning, 39(3):385-429, 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Carral et al., 2017] David Carral, Irina Dragoste, and Markus Krötzsch. Detecting chase (non)termination for existential rules with disjunctions. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 922-928, 2017.","title":"Detecting chase (non)termination for existential rules with disjunctions","authors":"David Carral, Irina Dragoste, Markus Krötzsch","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Delivorias et al., 2018] Stathis Delivorias, Michel Leclère, Marie-Laure Mugnier, and Federico Ulliana. On the k-boundedness for existential rules. In International Joint Conference on Rules and Reasoning, pages 48-64. Springer, 2018.","title":"On the k-boundedness for existential rules","authors":"Stathis Delivorias, Michel Leclère, Marie-Laure Mugnier, Federico Ulliana","year":"2018","venue":"International Joint Conference on Rules and Reasoning","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fagin et al., 2005] Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: seman- tics and query answering. Theor. Comput. Sci., 336(1):89- 124, 2005.","title":"Data exchange: seman-tics and query answering","authors":"Ronald Fagin, G Phokion, Renée J Kolaitis, Lucian Miller, Popa","year":"2005","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gottlob et al., 2014] Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Thomas Schwentick, and Michael Zakharyaschev. The price of query rewriting in ontology-based data access. Artificial Intelligence, 213:42-59, 2014.","title":"The price of query rewriting in ontology-based data access","authors":"Gottlob","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Grau et al., 2013] Bernardo Cuenca Grau, Ian Horrocks, Markus Krötzsch, Clemens Kupke, Despoina Magka, Boris Motik, and Zhe Wang. Acyclicity notions for ex- istential rules and their application to query answering in ontologies. J. Artif. Intell. Res., 47:741-808, 2013.","title":"Acyclicity notions for existential rules and their application to query answering in ontologies","authors":"Cuenca Bernardo, Ian Grau, Markus Horrocks, Clemens Krötzsch, Despoina Kupke, Boris Magka, Zhe Motik, Wang","year":"2013","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Guessarian and Peixoto, 1994] Irène Guessarian and Mar- cos Veloso Peixoto. About boundedness for some datalog and datalog neg programs. J. Log. Comput., 4(4):375-403, 1994.","title":"Irène Guessarian and Marcos Veloso Peixoto. About boundedness for some datalog and datalog neg programs","authors":"Peixoto Guessarian","year":"1994","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hernich and Schweikardt, 2007] André Hernich and Nicole Schweikardt. Cwa-solutions for data exchange settings with target dependencies. In Proceedings of the Twenty- Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Bei- jing, China, pages 113-122, 2007.","title":"Cwa-solutions for data exchange settings with target dependencies","authors":"Schweikardt Hernich","year":"2007","venue":"Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hillebrand et al., 1995] Gerd G Hillebrand, Paris C Kanel- lakis, Harry G Mairson, and Moshe Y Vardi. Undecidable boundedness problems for datalog programs. The Journal of logic programming, 25(2):163-190, 1995.","title":"Undecidable boundedness problems for datalog programs","authors":"G Gerd, Paris C Hillebrand, Kanellakis, Moshe Y Harry G Mairson, Vardi","year":"1995","venue":"The Journal of logic programming","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[König et al., 2013] Mélanie König, Michel Leclère, Marie- Laure Mugnier, and Michaël Thomazo. On the exploration of the query rewriting space with existential rules. In Web Reasoning and Rule Systems -7th International Confer- ence, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings, pages 123-137, 2013.","title":"On the exploration of the query rewriting space with existential rules","authors":"Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo","year":"2013","venue":"Web Reasoning and Rule Systems -7th International Conference, RR 2013","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Marnette, 2009] Bruno Marnette. Generalized schema- mappings: from termination to tractability. In Proceed- ings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 -July 1, 2009, Providence, Rhode Island, USA, pages 13-22, 2009.","title":"Generalized schemamappings: from termination to tractability","authors":"Bruno Marnette","year":"2009","venue":"Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}