Temporalising Tractable Description Logics

A. ArtaleA. Artale, R. KontchakovR. Kontchakov, Carsten LutzCarsten Lutz, Frank WolterFrank Wolter, M. ZakharyaschevM. Zakharyaschev

Download

A. Artale, R. Kontchakov, Carsten Lutz, Frank Wolter, M. Zakharyaschev
Temporalising Tractable Description Logics
Proceedings of the Fourteenth International Symposium on Temporal Representation and Reasoning, 2007. IEEE Computer Society Press

Details
Bibtex

KurzfassungAbstract
It is known that for temporal languages, such as first-order LTL, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal description logics as well: constant binary relations together with general concept subsumptions in combinations of LTL and the basic description logic ALC cause undecidability. In this paper, we explore temporal extensions of two recently introduced families of "weak" description logics known as DL-Lite and EL. Our results are twofold: temporalisations of even rather expressive variants of DL-Lite turn out to be decidable, while the temporalisation of EL with general concept subsumptions and constant relations is undecidable.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ ArKoLuWoZa-TIME-07,
  author = {A. {Artale} and R. {Kontchakov} and C. {Lutz} and F. {Wolter} and M. {Zakharyaschev}},
  booktitle = {Proceedings of the Fourteenth International Symposium on Temporal Representation and Reasoning},
  publisher = {IEEE Computer Society Press},
  title = {Temporalising Tractable Description Logics},
  year = {2007},
}