Undecidability Results for Database-Inspired Reasoning Problems in Very Expressive Description Logics

Recently, the field of knowledge representation is drawing a lot of inspiration from database theory. In particular, in the area of description logics and ontology languages, interest has shifted from satisfiability checking to query answering, with various query notions adopted from databases, like (unions of) conjunctive queries or different kinds of path queries. Likewise, the finite model semantics is being established as a viable and interesting alternative to the traditional semantics based on unrestricted models. In this paper, we investigate diverse database-inspired reasoning problems for very expressive description logics (all featuring the worrisome trias of inverses, counting, and nominals) which have in common that role paths of unbounded length can be described (in the knowledge base or of the query), leading to a certain non-locality of the reasoning problem. We show that for all the cases considered, undecidability can be established by very similar means. Most notably, we show undecidability of finite entailment of unions of conjunctive queries for a fragment of SHOIQ (the logic underlying the OWL DL ontology language), and un-decidability of finite entailment of conjunctive queries for a fragment of SROIQ (the logical basis of the more recent and popular OWL 2 DL standard).

[1]  Sebastian Rudolph,et al.  Foundations of Description Logics , 2011, Reasoning Web.

[2]  Diego Calvanese,et al.  Finite Model Reasoning in Description Logics , 1996, KR.

[3]  I. Horrocks,et al.  A Tableau Decision Procedure for $\mathcal{SHOIQ}$ , 2007, Journal of Automated Reasoning.

[4]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[5]  Aniello Murano,et al.  The Complexity of Enriched Mu-Calculi , 2008, Log. Methods Comput. Sci..

[6]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

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

[8]  Peter Buneman,et al.  Semistructured data , 1997, PODS.

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

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

[11]  Piero A. Bonatti.  On the Undecidability of Description and Dynamic Logics with Recursion and Counting , 2003, IJCAI.

[12]  Piero A. Bonatti,et al.  On the undecidability of logics with converse, nominals, recursion and counting , 2004, Artif. Intell..

[13]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

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

[15]  Ulrike Sattler,et al.  The complexity of finite model reasoning in description logics , 2005, Inf. Comput..

[16]  Ian Horrocks,et al.  A Tableaux Decision Procedure for SHOIQ , 2005, IJCAI.

[17]  Stéphane Demri,et al.  Deciding Regular Grammar Logics with Converse Through First-Order Logic , 2003, J. Log. Lang. Inf..

[18]  Sebastian Rudolph,et al.  Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! , 2010, J. Artif. Intell. Res..

[19]  Alon Y. Halevy,et al.  CARIN: A Representation Language Combining Horn Rules and Description Logics , 1996, ECAI.

[20]  Carsten Lutz,et al.  Finite Model Reasoning in Horn Description Logics , 2014, KR.

[21]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[22]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

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

[24]  Ian Horrocks,et al.  A Description Logic Primer , 2012, ArXiv.

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

[26]  Sebastian Rudolph,et al.  Schema-Agnostic Query Rewriting in SPARQL 1.1 , 2014, International Semantic Web Conference.

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

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

[29]  Yevgeny Kazakov,et al.  SRIQ and SROIQ are Harder than SHOIQ , 2008, Description Logics.

[30]  Sebastian Rudolph,et al.  The Two Views on Ontological Query Answering , 2014, AMW.

[31]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[32]  Riccardo Rosati.  On the finite controllability of conjunctive query answering in databases under open-world assumption , 2011, J. Comput. Syst. Sci..

[33]  Yevgeny Kazakov,et al.  RIQ and SROIQ Are Harder than SHOIQ , 2008, KR.