Data Complexity of Reasoning in Very Expressive Description Logics

DMCA

Data Complexity of Reasoning in Very Expressive Description Logics (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ullrich Hustadt , Boris Motik , Ulrike Sattler

Venue:	IN PROC. IJCAI 2005
Citations:	121 - 20 self

BibTeX

@INPROCEEDINGS{Hustadt05datacomplexity,
    author = {Ullrich Hustadt and Boris Motik and Ulrike Sattler},
    title = {Data Complexity of Reasoning in Very Expressive Description Logics},
    booktitle = {IN PROC. IJCAI 2005},
    year = {2005},
    pages = {466--471},
    publisher = {Professional Book Center}
}

OpenURL

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.

Keyphrases

data complexity expressive description logic expressive fragment practical usage accurate estimate data complete satisfiability checking combined complexity expressive dl shiq description logic large aboxes

DMCA