A Tableau Algorithm for Description Logics with Concrete Domains and GCIs

C. LutzC. Lutz, M. MilicicM. Milicic

Download

C. Lutz, M. Milicic
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
Proceedings of the 14th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods {TABLEAUX 2005}, LNAI, 2005. Springer

Details
Bibtex

KurzfassungAbstract
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.

Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ LutzMilicic-Tableaux2005,
  address = {Koblenz, Germany},
  author = {C. {Lutz} and M. {Milicic}},
  booktitle = {Proceedings of the 14th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods {TABLEAUX 2005}},
  publisher = {Springer},
  series = {LNAI},
  title = {A Tableau Algorithm for Description Logics with Concrete Domains and GCIs},
  year = {2005},
}