A Tableau Algorithm for DLs with Concrete Domains and GCIs

Carsten LutzCarsten Lutz, M. MilicicM. Milicic

Datei:LutzMilicic-LTCS-05-07.ps.gz

Download

Carsten Lutz, M. Milicic
A Tableau Algorithm for DLs with Concrete Domains and GCIs
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume LTCS-05-07, 2005. LTCS-Report

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.
Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ LutzMilicic-LTCS-05-07,
  address = {Germany},
  author = {C. {Lutz} and M. {Milicic}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-07},
  title = {A Tableau Algorithm for DLs with Concrete Domains and GCIs},
  type = {LTCS-Report},
  year = {2005},
}