CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Attributive concept descriptions with complements
Artificial Intelligence
KRIS: Knowledge Representation and Inference System
ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
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
The Complexity of Reasoning with Concrete Domains Revised Version
The Complexity of Reasoning with Concrete Domains Revised Version
On the Complexity of Terminological Reasoning
On the Complexity of Terminological Reasoning
A logic based context query language
EuroSSC'10 Proceedings of the 5th European conference on Smart sensing and context
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
| Hi-index | 0.00 |
Description logics are formalisms for the representation of and reasoning about conceptual knowledge on an abstract level. Concrete domains allow the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals, or spatial regions. The importance of this combined approach, especially for building real-world applications, is widely accepted. However, the complexity of reasoning with concrete domains has never been formally analyzed and efficient algorithms have not been developed. This paper closes the gap by providing a tight bound for the complexity of reasoning with concrete domains and presenting optimal algorithms.