论文信息 - Data Complexity of Reasoning in Very Expressive Description Logics

Data Complexity of Reasoning in Very Expressive Description Logics

Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size of the ABox only. We show that, even for the very expressive DL SHIQ, satisfiability checking is data complete for NP. For applications with large ABoxes, this can be a more accurate estimate than the usually considered combined complexity, which is EXPTIME-complete. Furthermore, we identify an expressive fragment, Horn-SHIQ, which is data complete for P, thus being very appealing for practical usage.

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

[2] Christoph Weidenbach,et al. Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[3] Moshe Y. Vardi. On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[4] Stephan Tobies,et al. Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[5] Wayne Snyder,et al. Basic Paramodulation , 1995, Inf. Comput..

[6] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.

[7] Andrea Schaerf. Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity, and Seman , 1994 .

[8] Boris Motik,et al. Reducing SHIQ-Description Logic to Disjunctive Datalog Programs , 2004, KR.

[9] Moshe Y. Vardi. On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[10] Albert Rubio,et al. Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[11] Klaus Schild,et al. A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[12] Diego Calvanese,et al. DL-Lite: Practical Reasoning for Rich Dls , 2004, Description Logics.

[13] Boris Motik,et al. Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution , 2004, ECAI.