Data Complexity of Reasoning in Very Expressive Description Logics (2005)
| Venue: | IN PROC. IJCAI 2005 |
| Citations: | 82 - 13 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}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
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.
