Interval-based Temporal Reasoning with General TBoxes
From International Center for Computational Logic
Interval-based Temporal Reasoning with General TBoxes
Carsten LutzCarsten Lutz
Carsten Lutz
Interval-based Temporal Reasoning with General TBoxes
In Bernhard Nebel, eds., Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence IJCAI-01, 89-94, 2001. Morgan-Kaufmann Publishers
Interval-based Temporal Reasoning with General TBoxes
In Bernhard Nebel, eds., Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence IJCAI-01, 89-94, 2001. Morgan-Kaufmann Publishers
- 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 is decidable. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Lutz-IJCAI-01,
address = {Seattle, Washington, USA},
author = {C. {Lutz}},
booktitle = {Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence {IJCAI-01}},
editor = {Bernhard {Nebel}},
pages = {89--94},
publisher = {Morgan-Kaufmann Publishers},
title = {Interval-based Temporal Reasoning with General {TBoxes}},
year = {2001},
}
