DMCA
Complexity of Terminological Reasoning Revisited (1999)
Cached
Download Links
- [www-lti.informatik.rwth-aachen.de]
- [lat.inf.tu-dresden.de]
- [www.dblab.ntua.gr]
- DBLP
Other Repositories/Bibliography
| Citations: | 36 - 6 self |
BibTeX
@INPROCEEDINGS{Lutz99complexityof,
author = {Carsten Lutz},
title = {Complexity of Terminological Reasoning Revisited},
booktitle = {},
year = {1999},
pages = {181--200},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. TBoxes in their various forms are key components of knowledge representation systems based on description logics (DLs) since they allow for a natural representation of terminological knowledge. Largely due to a classical result given by Nebel [15], complexity analyses for DLs have, until now, mostly failed to take into account the most basic form of TBoxes, so-called acyclic TBoxes. In this paper, we concentrate on DLs for which reasoning without TBoxes is PSpace-complete, and show that there exist logics for which the complexity of reasoning remains in PSpace if acyclic TBoxes are added and also logics for which the complexity increases. This demonstrates that it is necessary to take acyclic TBoxes into account for complexity analyses. 1 Introduction A core feature of description logics is their ability to represent and reason about terminological knowledge. Terminological knowledge is stored in so-called TBoxes which mainly come in two avours. So-called acyclic TBoxes are sets o...
