Interval-based Temporal Reasoning with General TBoxes

Carsten Lutz

Abstract

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.
BibTeX
@inproceedings{lutz2001interval,
  author = {Carsten Lutz},
  title = {{Interval-based Temporal Reasoning with General TBoxes}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2001},
  url = {https://openreview.net/forum?id=Hk-NbVfdWH},
}

Loading related content...

Figure