Terminological reasoning is inherently intractable (research note)
Artificial Intelligence
Attributive concept descriptions with complements
Artificial Intelligence
The complexity of concept languages
Information and Computation
Reasoning in description logics
Principles of knowledge representation
Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Reasoning with Concrete Domains
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Terminological Knowledge Representation System with Complete Inference Algorithms
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
Reasoning in expressive description logics
Handbook of automated reasoning
On the Complexity of Terminological Reasoning
On the Complexity of Terminological Reasoning
A temporal description logic for reasoning about actions and plans
Journal of Artificial Intelligence Research
A scheme for integrating concrete domains into concept languages
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
NEXPTIME-Complete Description Logics with Concrete Domains
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Tableau Algorithm for Possibilistic Description Logic $\mathcal{ALC}$
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Description logic reasoning for semantic web ontologies
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Generalized satisfiability for the description logic ALC
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A new n-ary existential quantifier in description logics
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
A tableau algorithm for description logics with concrete domains and GCIs
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Description logics and fuzzy probability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
An Efficient Tableau Prover using Global Caching for the Description Logic ALC
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Syntactic labelled tableaux for Łukasiewicz fuzzy ALC
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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 terminologicsd 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, sad 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 cinalyses.