Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Description logics for conceptual data modeling
Logics for databases and information systems
Maintaining knowledge about temporal intervals
Communications of the ACM
Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Complexity of Terminological Reasoning Revisited
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Combining interval-based temporal reasoning with general TBoxes
Artificial Intelligence
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
A scheme for integrating concrete domains into concept languages
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
LTL Over integer periodicity constraints
Theoretical Computer Science
An automata-theoretic approach to constraint LTL
Information and Computation
| Hi-index | 0.00 |
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extension. So-called general concept inclusions (GCIs) play an important role for capturing background knowledge. It is well-known that, when combining concrete domains with GCIs, reasoning easily becomes undecidable. In this paper, we identify a general property of concrete domains that is sufficient for proving decidability of DLs with both concrete domains and GCIs. We exhibit some useful concrete domains, most notably a spatial one based on the RCC-8 relations, which have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with concrete domains and GCIs.