Query Answering in the Description Logic Horn-SHIQ ⋆

We provide an ExpTime algorithm for answering conjunctive queries (CQs) in Horn-SHIQ, a Horn fragment of the well-known Description Logic SHIQ underlying the OWL-Lite standard. The algorithm employs a domino system for model representation, which is constructed via a worst-case optimal tableau algorithm for Horn-SHIQ; the queries are answered by reasoning over the domino system. Our algorithm not only shows that CQ answering in Horn-SHIQ is not harder than satisfiability testing, but also that it is polynomial in data complexity, making Horn-SHIQ an attractive expressive Description Logic.

[1]  Ian Horrocks,et al.  Optimising Tableaux Decision Procedures For Description Logics , 1997 .

[2]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[3]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

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

[5]  Boris Motik,et al.  Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

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

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

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

[9]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[10]  Riccardo Rosati,et al.  On Conjunctive Query Answering in EL , 2007, Description Logics.

[11]  Boris Motik,et al.  Optimized Reasoning in Description Logics Using Hypertableaux , 2007, CADE.

[12]  Sebastian Rudolph,et al.  Conjunctive Queries for a Tractable Fragment of OWL 1.1 , 2007, ISWC/ASWC.

[13]  Sebastian Rudolph,et al.  Complexity Boundaries for Horn Description Logics , 2007, AAAI.

[14]  Carsten Lutz,et al.  Inverse Roles Make Conjunctive Queries Hard , 2007, Description Logics.

[15]  Carsten Lutz,et al.  Two Upper Bounds for Conjunctive Query Answering in SHIQ , 2008, Description Logics.

[16]  Sebastian Rudolph,et al.  Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams , 2008, AAAI.

[17]  Thomas Eiter,et al.  Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses , 2008, AAAI.

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