First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries

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.

[1]  Achim Blumensath,et al.  Decidability Results for the Boundedness Problem , 2014, Log. Methods Comput. Sci..

[2]  Moshe Y. Vardi,et al.  Does query evaluation tractability help query containment? , 2014, PODS.

[3]  Richard A. Shore.  Logical methods in mathematics and computer science: A symposium in honor of Anil Nerode's sixtieth birthday , 1993 .

[4]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[5]  Haim Gaifman,et al.  Decidable Optimization Problems for Database Logic Programs (Preliminary Report) , 1988, STOC 1988.

[6]  Thomas Colcombet,et al.  The Bridge Between Regular Cost Functions and Omega-Regular Languages , 2016, ICALP.

[7]  Thomas Colcombet,et al.  The Complexity of Boundedness for Guarded Logics , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[8]  Andrea Calì,et al.  A general Datalog-based framework for tractable query answering over ontologies , 2012, J. Web Semant..

[9]  Carsten Lutz,et al.  Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability , 2017, IJCAI.

[10]  Daniel W. Gillman.  Data Semantics , 2017, Encyclopedia of GIS.

[11]  Moshe Y. Vardi.  Automata Theory for Database Theoreticans , 1991, Theoretical Studies in Computer Science.

[12]  Andrea Calì,et al.  Towards more expressive ontology languages: The query answering problem , 2012, Artif. Intell..

[13]  Balder ten Cate,et al.  Guarded Negation , 2011, Advances in Modal Logic.

[14]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[15]  Giorgio Orsi,et al.  Query Rewriting and Optimization for Ontological Databases , 2014, TODS.

[16]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[17]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[18]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[19]  Carsten Lutz,et al.  First-Order Rewritability of Atomic Queries in Horn Description Logics , 2013, IJCAI.

[20]  Carsten Lutz,et al.  First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics , 2016, Description Logics.

[21]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[22]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..