Data Complexity of Reasoning in Very Expressive Description Logics

Abstract

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.

Extracted Key Phrases

3 Figures and Tables

02040'04'06'08'10'12'14'16
Citations per Year

292 Citations

Semantic Scholar estimates that this publication has 292 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Hustadt2005DataCO, title={Data Complexity of Reasoning in Very Expressive Description Logics}, author={Ullrich Hustadt and Boris Motik and Ulrike Sattler}, booktitle={IJCAI}, year={2005} }