Terminological reasoning is inherently intractable (research note)
Artificial Intelligence
Attributive concept descriptions with complements
Artificial Intelligence
Cardinality restrictions on concepts
Artificial Intelligence
The complexity of concept languages
Information and Computation
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Description logics for conceptual data modeling
Logics for databases and information systems
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Extensions of Concept Languages for a Mechanical Engineering Application
GWAI '92 Proceedings of the 16th German Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Concept Language Extended with Different Kinds of Transitive Roles
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Data Models in Knowledge Representation System: A Case Study
GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung
Reasoning in expressive description logics
Handbook of automated reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
Fusions of description logics and abstract description systems
Journal of Artificial Intelligence Research
Keys, nominate, and concrete domains
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Interval-based temporal reasoning with general TBoxes
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Ontology reasoning in the SHOQ(D) description logic
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Logic-based knowledge representation
Artificial intelligence today
Combining interval-based temporal reasoning with general TBoxes
Artificial Intelligence
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
LTL Over integer periodicity constraints
Theoretical Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of qualitative Z constraints
Theoretical Computer Science
Reasoning within intuitionistic fuzzy rough description logics
Information Sciences: an International Journal
Keys, nominals, and concrete domains
Journal of Artificial Intelligence Research
Keys, nominate, and concrete domains
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Reasoning within expressive fuzzy rough description logics
Fuzzy Sets and Systems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Expressive fuzzy description logics over lattices
Knowledge-Based Systems
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Towards a fuzzy description logic for the semantic web (preliminary report)
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Semantic mappings in description logics for spatio-temporal database schema integration
Journal on Data Semantics III
Model-driven ontology engineering
Journal on Data Semantics VII
Satisfiability of CTL* with constraints
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
Concrete domains are an extension of Description Logics (DLs) that allow one to integrate reasoning about conceptual knowledge with reasoning about "concrete qualities" of real-world entities such as their sizes, weights, and durations. In this article, we are concerned with the complexity of Description Logics providing for concrete domains: starting from the complexity result established in Lutz [2002b], which states that reasoning with the basic propositionally closed DL with concrete domains ALC(D) is PSpace-complete (provided that some weak conditions are satisfied), we perform an in-depth analysis of the complexity of extensions of this logic. More precisely, we consider five natural and seemingly "harmless" extensions of ALC(D) and prove that, for all five extensions, reasoning is NExpTime-complete (again if some weak conditions are satisfied). Thus, we show that the PSpace upper bound for reasoning with ALC(D) cannot be considered robust with respect to extensions of the language.