Artale, A. and Kontchakov, Roman and Lutz, C. and Wolter, F. and Zakharyaschev, M. (2007) Temporalising tractable description logics. In: UNSPECIFIED (ed.) 14th International Symposium on Temporal Representation and Reasoning. IEEE Computer Society, pp. 11-22.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 11 May 2021 14:29 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/44221 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
