On Temporal Cardinality in the Context of the TOWL Language
ER '08 Proceedings of the ER 2008 Workshops (CMLSA, ECDM, FP-UML, M2AS, RIGiM, SeCoGIS, WISM) on Advances in Conceptual Modeling: Challenges and Opportunities
Improving an RCC-Derived Geospatial Approximation by OWL Axioms
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Conceptual Modeling: Foundations and Applications
Towards spatial reasoning in fuzzy description logics
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
Mobile semantic-based matchmaking: a fuzzy DL approach
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Context provenance to enhance the dependability of ambient intelligence systems
Personal and Ubiquitous Computing
Scalable geo-thematic query answering
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Decomposition and tractability in qualitative spatial and temporal reasoning
Artificial Intelligence
A probabilistic ontological framework for the recognition of multilevel human activities
Proceedings of the 2013 ACM international joint conference on Pervasive and ubiquitous computing
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Satisfiability of CTL* with constraints
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In order to use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but for which reasoning is still decidable. Two means of expressivity required by many modern applications of DLs are concrete domains and general TBoxes. The former are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extension. The purpose of the latter is to capture background knowledge by stating that the extension of a concept is included in the extension of another concept. Unfortunately, combining concrete domains with general TBoxes often leads to DLs for which reasoning is 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 general TBoxes. We exhibit some useful concrete domains, most notably a spatial one based on the RCC-8 relations that have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with concrete domains and general TBoxes.