U. Hustadt, B. Motik, and U. Sattler (2005b): ``Data Complexity of Reasoning in Very Expressive Description Logics.'' In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence IJCAI 2005 (Edinburgh, Scotland, July 30-August 5 2005), pp. 466-471.
Abstract, BibTeX, PDF (© IJCAI).

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 EXPTIMEcomplete. Furthermore, we identify an expressive fragment, Horn-SHIQ, which is data complete for P, thus being very appealing for practical usage. [an error occurred while processing this directive]