{"type":"ScholarlyArticle","title":"First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries","authors":[{"name":"Pablo Barceló","slug":"pablo-barcelo","given":"Pablo","family":"Barceló","affiliation":"Millennium Institute for Foundational Research on Data & DCC , University of Chile"},{"name":"Gerald Berger","slug":"gerald-berger","given":"Gerald","family":"Berger","affiliation":"Institute of Logic and Computation , TU Wien"},{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":"Department of Mathematics and Computer Science , University of Bremen"},{"name":"Andreas Pieris","slug":"andreas-pieris","given":"Andreas","family":"Pieris","affiliation":"School of Informatics , University of Edinburgh"}],"abstract":"We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded existential rules and (unions of) conjunctive queries, and we investigate the problem of FO-rewritability, i.e., whether an OMQ can be rewritten as a first-order query. We adopt two different approaches. The first approach employs standard two-way alternating parity tree automata. Although it does not lead to a tight complexity bound, it provides a transparent solution based on widely known tools. The second approach relies on a sophisticated automata model, known as cost automata. This allows us to show that our problem is 2EXPTIME-complete. In both approaches, we provide semantic characterizations of FO-rewritability that are of independent interest.","doi":"10.24963/ijcai.2018/236","url":"https://ijcai.org/proceedings/2018/236","pdf":"https://ijcai.org/proceedings/2018/0236.pdf","markdown":"https://ijcai.org/proceedings/2018/236.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/236","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":"Knowledge Representation and Reasoning","track":"Main track","number":236,"pages":{"first":1707,"last":1713},"keywords":["Multidisciplinary Topics and Applications: Databases","Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[],"references":[{"position":1,"raw":"[Ajtai and Gurevich, 1994] Miklós Ajtai and Yuri Gurevich. Datalog vs first-order logic. J. Comput. Syst. Sci., 49(3):562-588, 1994.","title":"Miklós Ajtai and Yuri Gurevich. Datalog vs first-order logic","authors":"Gurevich Ajtai","year":"1994","venue":"J. Comput. Syst. Sci","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":"[Bárány et al., 2015] Vince Bárány, Balder ten Cate, and Luc Segoufin. Guarded negation. J. ACM, 62(3):22:1-22:26, 2015.","title":"Guarded negation","authors":"Vince Bárány, Luc Balder Ten Cate, Segoufin","year":"2015","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Barceló et al., 2014] Pablo Barceló, Miguel Romero, and Moshe Y. Vardi. Does query evaluation tractability help query containment? In PODS, pages 188-199, 2014.","title":"Does query evaluation tractability help query containment?","authors":"Barceló","year":"2014","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Benedikt et al., 2015] Michael Benedikt, Balder ten Cate, Thomas Colcombet, and Michael Vanden Boom. The complexity of boundedness for guarded logics. In LICS, pages 293-304, 2015.","title":"The complexity of boundedness for guarded logics","authors":"Michael Benedikt, Thomas Balder Ten Cate, Michael Colcombet, Boom Vanden","year":"2015","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bienvenu et al., 2013] Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. First-order rewritability of atomic queries in horn description logics. In IJCAI, 2013.","title":"First-order rewritability of atomic queries in horn description logics","authors":"Bienvenu","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/118"},{"position":7,"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 Trans. Database Syst., 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 Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bienvenu et al., 2016] Meghyn Bienvenu, Peter Hansen, Carsten Lutz, and Frank Wolter. First order-rewritability and containment of conjunctive queries in horn description logics. In IJCAI, pages 965-971, 2016.","title":"First order-rewritability and containment of conjunctive queries in horn description logics","authors":"Bienvenu","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/141"},{"position":9,"raw":"[Blumensath et al., 2014] Achim Blumensath, Martin Otto, and Mark Weyer. Decidability results for the boundedness problem. Logical Methods in Computer Science, 10(3), 2014.","title":"Decidability results for the boundedness problem","authors":"Blumensath","year":"2014","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calì et al., 2012a] Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14:57-83, 2012.","title":"A general datalog-based framework for tractable query answering over ontologies","authors":"Calì","year":"2012","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Calì et al., 2012b] Andrea Calì, Georg Gottlob, and An- dreas Pieris. Towards more expressive ontology lan- guages: The query answering problem. Artif. Intell., 193:87-128, 2012.","title":"Towards more expressive ontology languages: The query answering problem","authors":"Calì","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"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":13,"raw":"[Colcombet and Fijalkow, 2016] Thomas Colcombet and Nathanaël Fijalkow. The bridge between regular cost functions and omega-regular languages. In ICALP, pages 126:1-126:13, 2016.","title":"Thomas Colcombet and Nathanaël Fijalkow. The bridge between regular cost functions and omega-regular languages","authors":"Fijalkow Colcombet","year":"2016","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cosmadakis et al., 1988] Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, and Moshe Y. Vardi. De- cidable optimization problems for database logic programs (preliminary report). In STOC, pages 477-490, 1988.","title":"Decidable optimization problems for database logic programs","authors":"Stavros S Cosmadakis, Haim Gaifman, Paris C Kanellakis, Moshe Y Vardi","year":"1988","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":15,"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: semantics 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":16,"raw":"[Gaifman et al., 1993] Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, and Moshe Y. Vardi. Undecidable op- timization problems for database logic programs. J. ACM, 40(3):683-713, 1993.","title":"Undecidable optimization problems for database logic programs","authors":"Haim Gaifman, Harry G Mairson, Yehoshua Sagiv, Moshe Y Vardi","year":"1993","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gottlob et al., 2014] Georg Gottlob, Giorgio Orsi, and An- dreas Pieris. Query rewriting and optimization for ontolog- ical databases. ACM Trans. Database Syst., 39(3):25:1- 25:46, 2014.","title":"Query rewriting and optimization for ontological databases","authors":"Gottlob","year":"2014","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lutz and Sabellek, 2017] Carsten Lutz and Leif Sabellek. Ontology-mediated querying with the description logic EL: trichotomy and linear datalog rewritability. In IJCAI, pages 1181-1187, 2017.","title":"Ontology-mediated querying with the description logic EL: trichotomy and linear datalog rewritability","authors":"Sabellek Lutz, Carsten Lutz, Leif Sabellek","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/164"},{"position":19,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenz- erini, and Riccardo Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.","title":"Linking data to ontologies","authors":"Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati","year":"2008","venue":"J. Data Semantics","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rossman, 2008] Benjamin Rossman. Homomorphism preservation theorems. J. ACM, 55(3):15:1-15:53, 2008.","title":"Homomorphism preservation theorems","authors":"Benjamin Rossman","year":"2008","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Vardi, 1992] Moshe Y. Vardi. Automata theory for database theoreticans. In Theoretical Studies in Computer Science, pages 153-180, 1992.","title":"Automata theory for database theoreticans","authors":"Moshe Y Vardi","year":"1992","venue":"Theoretical Studies in Computer Science","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Vardi, 1998] Moshe Y. Vardi. Reasoning about the past with two-way automata. In ICALP, pages 628-641, 1998.","title":"Reasoning about the past with two-way automata","authors":"Moshe Y Vardi","year":"1998","venue":"ICALP","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}