On Query Answering in Description Logics with Number Restrictions on Transitive Roles

We study query answering in the description logic SQ supporting number restrictions on both transitive and non-transitive roles. Our main contributions are (i) a tree-like model property for SQ knowledge bases and, building upon this, (ii) an automata based decision procedure for answering two-way regular path queries, which gives a 3ExpTime upper bound.

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

[2]  Franz Baader,et al.  Qualifying Number Restrictions in Concept Languages , 1991, KR.

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

[4]  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).

[5]  Ian Pratt-Hartmann,et al.  The two‐variable fragment with counting and equivalence , 2015, Math. Log. Q..

[6]  Thomas Eiter,et al.  Query Answering in the Description Logic S , 2010, Description Logics.

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

[8]  Robert Stevens,et al.  Using OWL to model biological knowledge , 2007, Int. J. Hum. Comput. Stud..

[9]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

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

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

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

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

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

[15]  Ian Horrocks,et al.  A Little Semantic Web Goes a Long Way in Biology , 2005, SEMWEB.

[16]  Franz Baader,et al.  Fusions of Description Logics and Abstract Description Systems , 2011, J. Artif. Intell. Res..

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

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

[19]  Alan L. Rector,et al.  Ontological and Practical Issues in Using a Description Logic to Represent Medical Concept Systems: Experience from GALEN , 2006, Reasoning Web.

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

[21]  Dirk Pattinson,et al.  How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics , 2008, KR.

[22]  Thomas Eiter,et al.  Query answering in description logics with transitive roles , 2009, IJCAI 2009.

[23]  Lidia Tendera.  Counting in the Two Variable Guarded Logic with Transitivity , 2005, STACS.

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

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

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

[27]  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.