Interval-based Temporal Reasoning with General TBoxes

Carsten Lutz
Interval-based Temporal Reasoning with General TBoxes
Technical Report, LuFG Theoretical Computer Science, RWTH Aachen, volume LTCS-00-06, 2000. LTCS-Report

Details
Bibtex

KurzfassungAbstract
Until now, interval-based temporal Description Logics (DLs) did---if at all---only admit TBoxes of a very restricted form, namely acyclic macro definitions. In this paper, we present a temporal DL that overcomes this deficieny and combines interval-based temporal reasoning with general TBoxes. We argue that this combination is very interesting for many application domains. An automata-based decision procedure is devised and a tight ExpTime-complexity bound is obtained. Since the presented logic can be viewed as being equipped with a concrete domain, our results can be seen from a different perspective: We show that there exist interesting concrete domains for which reasoning with general TBoxes in decidable.
Bemerkung: Note: See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ Lutz-LTCS-00-06,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-00-06},
  title = {Interval-based Temporal Reasoning with General TBoxes},
  type = {LTCS-Report},
  year = {2000},
}

Interval-based Temporal Reasoning with General TBoxes

Interval-based Temporal Reasoning with General TBoxes

Carsten LutzCarsten Lutz