Querying the Unary Negation Fragment with Regular Path Expressions

The unary negation fragment of first-order logic (UNFO) has recently been proposed as a generalization of modal logic that shares many of its good computational and model-theoretic properties. It is attractive from the perspective of database theory because it can express conjunctive queries (CQs) and ontologies formulated in many description logics (DLs). Both are relevant for ontology-mediated querying and, in fact, CQ evaluation under UNFO ontologies (and thus also under DL ontologies) can be `expressed' in UNFO as a satisfiability problem. In this paper, we consider the natural extension of UNFO with regular expressions on binary relations. The resulting logic UNFOreg can express (unions of) conjunctive two-way regular path queries (C2RPQs) and ontologies formulated in DLs that include transitive roles and regular expressions on roles. Our main results are that evaluating C2RPQs under UNFOreg ontologies is decidable, 2ExpTime-complete in combined complexity, and coNP-complete in data complexity, and that satisfiability in UNFOreg is 2ExpTime-complete, thus not harder than in UNFO.

[1]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

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

[3]  Sebastian Rudolph,et al.  Flag & check: data access with monadically defined queries , 2013, PODS '13.

[4]  Magdalena Ortiz,et al.  Ontology-Mediated Query Answering with Data-Tractable Description Logics , 2015, Reasoning Web.

[5]  Diego Calvanese,et al.  Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.

[6]  Carsten Lutz,et al.  Data Complexity in the EL Family of Description Logics , 2007, LPAR.

[7]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[8]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[9]  Diego Calvanese,et al.  Nested Regular Path Queries in Description Logics , 2014, KR.

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

[11]  Pablo Barceló,et al.  Containment for Rule-Based Ontology-Mediated Queries , 2017, PODS.

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

[13]  Carsten Lutz,et al.  Query Containment in Description Logics Reconsidered , 2012, KR.

[14]  Diego Calvanese,et al.  Reasoning in Expressive Description Logics , 2001, Handbook of Automated Reasoning.

[15]  Michael Zakharyaschev,et al.  An Introduction to Description Logics and Query Rewriting , 2014, Reasoning Web.

[16]  Giorgio Orsi,et al.  Datalog and Its Extensions for Semantic Web Databases , 2012, Reasoning Web.

[17]  Moshe Y. Vardi,et al.  Regular Queries on Graph Databases , 2015, ICDT.

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

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

[20]  Alberto O. Mendelzon,et al.  A graphical query language supporting recursion , 1987, SIGMOD '87.

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

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

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

[24]  Sebastian Rudolph,et al.  How to Best Nest Regular Path Queries , 2014, Description Logics.

[25]  Magdalena Ortiz,et al.  Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms , 2015, J. Artif. Intell. Res..

[26]  Michael Benedikt,et al.  Query Answering with Transitive and Linear-Ordered Data , 2016, IJCAI.

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

[28]  Carsten Lutz,et al.  Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics , 2016, KR.

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

[30]  Diego Calvanese,et al.  Answering regular path queries in expressive Description Logics via alternating tree-automata , 2014, Inf. Comput..

[31]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[32]  Diego Calvanese,et al.  Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach , 2007, AAAI.

[33]  Carsten Lutz,et al.  PDL with intersection and converse: satisfiability and infinite-state model checking , 2009, The Journal of Symbolic Logic.

[34]  Magdalena Ortiz,et al.  Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results , 2015, AMW.

[35]  Magdalena Ortiz,et al.  Conjunctive Regular Path Queries in Lightweight Description Logics , 2013, IJCAI.

[36]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[37]  Ian Horrocks,et al.  An Introduction to Description Logic , 2017 .

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

[39]  Franz Baader.  Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.

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

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

[42]  Wolf-Tilo Balke,et al.  Querying Graph Databases: What Do Graph Patterns Mean? , 2017, ER.

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

[44]  Philippe Schnoebelen,et al.  Oracle Circuits for Branching-Time Model Checking , 2003, ICALP.