Sharpening the Undecidability of Interval Temporal Logic
Interval temporal logics (ITLs) were introduced in the philosophy of time (see [Ben95] for a survey) but have proved useful in artificial intelligence and computer science [All83, HMM83, HS91, ZHR91]. They provide a rich specification language for systems working with dense time (for example, [RRM93]). By now, there is a whole menagerie of ITLs. In this paper, we work with the simplest (propositional) ITLs and discuss their decidability.
KeywordsModal Logic Turing Machine Dense Time Tense Logic Propositional Modal Logic
Unable to display preview. Download preview PDF.
- [Ben95]J. van Benthem. Temporal logic, in D. M. Gabbay, C. Hogger and J. A. Robinson (eds), Handbook of logic in artificial intelligence and logic programming IV (Oxford, 1995) 241–350.Google Scholar
- [Dut95]B. Dutertre. On first order interval temporal logic, Tech Report, Royal Holloway College, University of London (1995), http://www.csl.sri.com/~bruno/publis/ TR-CSD-94-3.ps.gz. [Also in Proc. 10th LICS (1995).]
- [HMM83]J. Y. Halpern, Z. Manna and B. Moszkowski. A hardware semantics based on temporal intervals, Proc. ICALP, LNCS 154 (1983) 278–291.Google Scholar
- [LR00]K. Lodaya and S. Roy. Lines, a while and intervals, presented at the Workshop on Many-dimensional logical systems, ESSLLI’ 00, Birmingham (2000).Google Scholar
- [Pan95]P. K. Pandya. Some extensions to propositional meanvalue calculus: expressiveness and decidability, Proc. CSL, LNCS 1092 (1995) 434–451.Google Scholar
- [RP86]R. Rosner and A. Pnueli. A choppy logic, Proc. 1st LICS (1986) 306–313.Google Scholar
- [ZHS93]Zhou C., M. R. Hansen and P. Sestoft. Decidability and undecidability results for duration calculus, Proc. STACS, LNCS 665 (1993) 58–68.Google Scholar