A Tableau Algorithm for DLs with Concrete Domains and GCIs

Carsten LutzCarsten Lutz, M. MilicicM. Milicic

Download

Carsten Lutz, M. Milicic
A Tableau Algorithm for DLs with Concrete Domains and GCIs
Proceedings of the 2005 International Workshop on Description Logics (DL2005), CEUR-WS, 2005

Details
Bibtex

KurzfassungAbstract
We identify a general property of concrete domains that is sufficient for proving decidability of DLs equipped with them and GCIs. We show that some useful concrete domains, such as a temporal one based on the Allen relations and a spatial one based on the RCC-8 relations, have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with such concrete domains.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ LutzMilicic-DL-2005,
  author = {C. {Lutz} and M. {Milicic}},
  booktitle = {Proceedings of the 2005 International Workshop on Description Logics ({DL2005})},
  number = {147},
  series = {CEUR-WS},
  title = {A Tableau Algorithm for DLs with Concrete Domains and GCIs},
  year = {2005},
}