Sharpening the undecidability of interval temporal logic. (English) Zbl 0987.03015
He, Jifeng (ed.) et al., Advances in computing science - ASIAN 2000. 6th Asian computing science conference, Penang, Malaysia, November 25-27, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1961, 290-298 (2000).
Summary: Interval temporal logics (ITLs) were introduced in the philosophy of time but have proved useful in artificial intelligence and computer science. They provide a rich specification language for systems working with dense time. By now, there is a whole menagerie of ITLs. In this paper, we work with the simplest (propositional) ITLs and discuss their decidability.
For the entire collection see [Zbl 0953.00041].
For the entire collection see [Zbl 0953.00041].
