On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles

We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles. We show tight 2EXPTIME upper bounds for unrestricted entailment of regular path queries for both extensions and finite entailment of positive existential queries for nominals. For inverses, we establish 2EXPTIME-completeness for unrestricted and finite entailment of instance queries (the latter under restriction to a single, transitive role).

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

[2]  Emanuel Kieronski,et al.  Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract) , 2019, Description Logics.

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

[4]  Jean Christoph Jung,et al.  Number Restrictions on Transitive Roles in Description Logics with Nominals , 2017, AAAI.

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

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

[7]  Filip Murlak,et al.  Finite Query Answering in Expressive Description Logics with Transitive Roles , 2018, KR.

[8]  Yevgeny Kazakov,et al.  A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[9]  Sebastian Rudolph,et al.  Undecidability Results for Database-Inspired Reasoning Problems in Very Expressive Description Logics , 2016, KR.

[10]  D. Nardi,et al.  An Introduction to Description Logic , 2017 .

[11]  Yevgeny Kazakov,et al.  How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited , 2007, LPAR.

[12]  Gert Smolka,et al.  Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles , 2009, Description Logics.

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

[14]  Michael Benedikt,et al.  Finite Open-World Query Answering with Number Restrictions , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[15]  Ian Horrocks,et al.  Unions of Conjunctive Queries in SHOQ , 2008, KR.

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

[17]  Riccardo Rosati.  Finite Model Reasoning in DL-Lite , 2008, ESWC.

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

[19]  Bartosz Bednarczyk,et al.  On the Complexity of Graded Modal Logics with Converse , 2018, JELIA.

[20]  Magdalena Ortiz,et al.  Closed Predicates in Description Logics: Results on Combined Complexity , 2016, AMW.

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

[22]  Jean Christoph Jung,et al.  Answering Regular Path Queries over SQ Ontologies , 2018, AAAI.

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

[24]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[25]  Gert Smolka,et al.  Terminating Tableaux for SOQ\mathcal{SOQ} with Number Restrictions on Transitive Roles , 2010, IFIP TCS.