On the complexity of Horn description logics (2006)
Cached
Download Links
| Venue: | PROCEEDINGS OF THE 2ND WORKSHOP ON OWL: EXPERIENCES AND DIRECTIONS. VOLUME 216 OF CEUR WORKSHOP PROCEEDINGS |
| Citations: | 7 - 4 self |
BibTeX
@INPROCEEDINGS{Krötzsch06onthe,
author = {Markus Krötzsch and Sebastian Rudolph and Pascal Hitzler},
title = { On the complexity of Horn description logics},
booktitle = {PROCEEDINGS OF THE 2ND WORKSHOP ON OWL: EXPERIENCES AND DIRECTIONS. VOLUME 216 OF CEUR WORKSHOP PROCEEDINGS},
year = {2006},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Horn-SHIQ has been identified as a fragment of the description logic SHIQ for which inferencing is in PTime with respect to the size of the ABox. This enables reasoning with larger ABoxes in situations where the TBox is static, and represents one approach towards tractable description logic reasoning. In this paper, we show that reasoning in Horn-SHIQ, in spite of its low datacomplexity, is ExpTime-hard with respect to the overall size of the knowledge base. While this result is not unexpected, the proof is not a mere modification of existing reductions since it has to account for the restrictions of Hornness. We establish the result for Horn-FLE, showing that Hornness does not simplify TBox reasoning even for very restricted description logics. Moreover, we derive a context-free grammar that defines Horn-SHIQ in a simpler and more intuitive way than existing characterisations.
