Combining interval-based temporal reasoning with general TBoxes

作者:

摘要

While classical Description Logics (DLs) concentrate on the representation of static conceptual knowledge, recently there is a growing interest in DLs that, additionally, allow to capture the temporal aspects of conceptual knowledge. Such temporal DLs are based either on time points or on time intervals as the temporal primitive. Whereas point-based temporal DLs are well-investigated, this is not the case for interval-based temporal DLs: all known logics either suffer from rather limited expressive power or have undecidable reasoning problems. In particular, there exists no decidable interval-based temporal DL that provides for general TBoxes—one of the most important expressive means in modern description logics. In this paper, for the first time we define an interval-temporal DL that is equipped with general TBoxes and for which reasoning is decidable (and, more precisely, ExpTime-complete).

论文关键词:Description logic,Temporal reasoning,Tree automata,Complexity

论文评审过程:Received 21 May 2003, Revised 6 August 2003, Available online 18 September 2003.

论文官网地址:https://doi.org/10.1016/j.artint.2003.08.001