Query Answering with Transitive and Linear-Ordered Data

We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be transitive, restricting a relation to be the transitive closure of another relation, and restricting a relation to be a linear order. We give some natural generalizations of guardedness that allow inference to be decidable in each case, and isolate the complexity of the corresponding decision problems. Finally we show that slight changes in our conditions lead to undecidability.

[1]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[2]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[3]  Michael Benedikt,et al.  A Step Up in Expressiveness of Decidable Fixpoint Logics , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[4]  Balder ten Cate,et al.  Queries with Guarded Negation , 2012, Proc. VLDB Endow..

[5]  Magdalena Ortiz,et al.  Reasoning and Query Answering in Description Logics , 2012, Reasoning Web.

[6]  Sebastian Rudolph,et al.  Reasonable highly expressive query languages , 2015 .

[7]  Chen Li,et al.  Data exchange in the presence of arithmetic comparisons , 2008, EDBT '08.

[8]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[9]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

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

[11]  Georg Gottlob,et al.  On the complexity of single-rule datalog queries , 2003, Inf. Comput..

[12]  Andreas Pieris,et al.  The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules , 2013, Description Logics.

[13]  Sebastian Rudolph,et al.  Conjunctive Queries for EL with Composition of Roles , 2007, Description Logics.

[14]  Diego Calvanese,et al.  Introducing Datatypes in DL-Lite , 2012, ECAI.

[15]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[16]  Sebastian Rudolph,et al.  A NSWERING IS UNDECIDABLE IN DL S WITH REGULAR EXPRESSIONS , INVERSES , NOMINALS , AND COUNTING , 2010 .

[17]  Georg Gottlob,et al.  On the Complexity of Single-Rule Datalog Queries , 1999, LPAR.

[18]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[19]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  Erich Grädel,et al.  Guarded fixed point logics and the monadic theory of countable trees , 2002, Theor. Comput. Sci..

[21]  Egor V. Kostylev,et al.  Conjunctive Queries with Negation over DL-Lite: A Closer Look , 2013, RR.

[22]  Paola Bonizzoni,et al.  On Automata on Infinite Trees , 1992, Theor. Comput. Sci..

[23]  Carsten Lutz,et al.  The Complexity of Conjunctive Query Answering in Expressive Description Logics , 2008, IJCAR.

[24]  Sebastian Rudolph,et al.  Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ , 2011, IJCAI.

[25]  Emanuel Kieronski,et al.  Decidability Issues for Two-Variable Logics with Several Linear Orders , 2011, CSL.

[26]  Georg Gottlob,et al.  Querying the Guarded Fragment with Transitivity , 2013, ICALP.

[27]  Margus Veanes,et al.  The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[28]  Wieslaw Szwast,et al.  The guarded fragment with transitive guards , 2004, Ann. Pure Appl. Log..

[29]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[30]  Diego Calvanese,et al.  Regular Path Queries in Expressive Description Logics with Nominals , 2009, IJCAI.

[31]  Alessandro Artale,et al.  DL-Lite with Attributes and Datatypes , 2012, ECAI.

[32]  Boris Motik,et al.  The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases , 2014, J. Artif. Intell. Res..

[33]  Riccardo Rosati,et al.  The Limits of Querying Ontologies , 2007, ICDT.

[34]  Thomas Eiter,et al.  Reasoning Web. Semantic Technologies for Advanced Query Answering , 2012, Lecture Notes in Computer Science.

[35]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[36]  Egor V. Kostylev,et al.  Queries with negation and inequalities over lightweight ontologies , 2015, J. Web Semant..

[37]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[38]  Mikolaj Bojanczyk,et al.  Finite satisfiability for guarded fixpoint logic , 2012, Inf. Process. Lett..

[39]  Jean-François Baget,et al.  Combining Existential Rules and Transitivity: Next Steps , 2015, IJCAI.

[40]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[41]  Sebastian Rudolph,et al.  Conjunctive Queries for EL with Role Composition ⋆ , 2007 .

[42]  Martin Otto,et al.  Two variable first-order logic over ordered domains , 2001, Journal of Symbolic Logic.

[43]  E. Szpilrajn.  Sur l'extension de l'ordre partiel , 1930 .

[44]  Lidia Tendera,et al.  On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards , 2007, LPAR.

[45]  R. Lathe.  Phd by thesis , 1988, Nature.

[46]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[47]  Sebastian Rudolph,et al.  Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.

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

[49]  Diego Calvanese,et al.  Decidable containment of recursive queries , 2003, Theor. Comput. Sci..