Sciweavers

Share
TABLEAUX
2005
Springer

A Tableau Algorithm for Description Logics with Concrete Domains and GCIs

10 years 19 days ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
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.
Carsten Lutz, Maja Milicic
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where TABLEAUX
Authors Carsten Lutz, Maja Milicic
Comments (0)
books