Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
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
Extensions of Concept Languages for a Mechanical Engineering Application
GWAI '92 Proceedings of the 16th German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Complexity of Terminological Reasoning Revisited
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Reasoning in expressive description logics
Handbook of automated reasoning
NExpTime complete Description Logics with Concrete Domains
NExpTime complete Description Logics with Concrete Domains
A scheme for integrating concrete domains into concept languages
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Interval-based temporal reasoning with general TBoxes
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The description logic handbook
ε-connections of abstract description systems
Artificial Intelligence
Interval-based temporal reasoning with general TBoxes
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Concrete domains are an extension of Description Logics (DLs) allowing to integrate reasoning about conceptual knowledge with reasoning about "concrete properties" of objects such as sizes, weights, and durations. It is known that reasoning with ALC(D), the basic DL admitting concrete domains, is PSPACE-complete. In this paper, it is shown that the upper bound is not robust: we give three examples for seemingly harmless extensions of ALC(D)|namely acyclic TBoxes, inverse roles, and a role-forming concrete domain constructor|that make reasoning NExpTime-hard. As a corresponding upper bound, we show that reasoning with all three extensions together is in NEXPTIME.