Complexity of Terminological Reasoning Revisited

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.

DOI: 10.1007/3-540-48242-3_12

Extracted Key Phrases

4 Figures and Tables

Statistics

01020'00'02'04'06'08'10'12'14'16
Citations per Year

97 Citations

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

See our FAQ for additional information.

Cite this paper

@inproceedings{Lutz1999ComplexityOT, title={Complexity of Terminological Reasoning Revisited}, author={Carsten Lutz}, booktitle={LPAR}, year={1999} }