Temporalising Tractable Description Logics

Abstract

It is known that for temporal languages, such as firstorder LT L, 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 LT L 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.

DOI: 10.1109/TIME.2007.62

Extracted Key Phrases

010202008200920102011201220132014201520162017
Citations per Year

91 Citations

Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Artale2007TemporalisingTD, title={Temporalising Tractable Description Logics}, author={Alessandro Artale and Roman Kontchakov and Carsten Lutz and Frank Wolter and Michael Zakharyaschev}, booktitle={TIME}, year={2007} }