A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes


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.

DOI: 10.1007/s10817-006-9049-7

Extracted Key Phrases

3 Figures and Tables

Citations per Year

87 Citations

Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Lutz2006ATA, title={A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes}, author={Carsten Lutz and Maja Milicic Brandt}, journal={Journal of Automated Reasoning}, year={2006}, volume={38}, pages={227-259} }