Answering Regular Path Queries over SQ Ontologies

We study query answering in the description logic SQ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for SQ-knowledge bases and, building upon this, an optimal automata-based algorithm for answering positive existential regular path queries in 2EXPTIME.

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

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

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

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

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

[6]  Jean Christoph Jung,et al.  On Query Answering in Description Logics with Number Restrictions on Transitive Roles , 2017, Description Logics.

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

[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]  Diego Calvanese,et al.  Regular Path Queries in Expressive Description Logics with Nominals , 2009, IJCAI.

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

[11]  Christopher J. Rawlings,et al.  Representing and querying disease networks using graph databases , 2016, BioData Mining.

[12]  Emek Demir,et al.  Algorithms for effective querying of compound graph-based pathway databases , 2009, BMC Bioinformatics.

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

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

[15]  Michaël Thomazo,et al.  Answering Conjunctive Regular Path Queries over Guarded Existential Rules , 2017, IJCAI.

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

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

[18]  Dan Suciu,et al.  Query containment for conjunctive queries with regular expressions , 1998, PODS.

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

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

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

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

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

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

[25]  Martin Fürer.  The Complexity of the Inequivalence Problem for Regular Expressions with Intersection , 1980, ICALP.

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