|
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 intervalbased 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 EXPTIMEcomplexity 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., |
