Abstract
Unlike the Moon, the dark side of interval temporal logics is the one we usually see: their ubiquitous undecidability. Identifying minimal undecidable interval logics is thus a natural and important issue in that research area. In this paper, we identify several new minimal undecidable logics amongst the fragments of Halpern and Shoham’s logic HS, including the logic of the overlaps relation, over the classes of all finite linear orders and all linear orders, as well as the logic of the meets and subinterval relations, over the classes of all and dense linear orders. Together with previous undecidability results, this work contributes to bringing the identification of the dark side of interval temporal logics very close to the definitive picture.
Similar content being viewed by others
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer (1997)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Decidable and undecidable fragments of Halpern and Shoham’s interval temporal logic: towards a complete classification. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) Proc. of the 15th Int. Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR). LNCS, vol. 5330, pp. 590–604. Springer (2008)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Undecidability of interval temporal logics with the overlap modality. In: Lutz, C., Raskin, J., (eds.) Proc. of 16th Int. Symposium on Temporal Representation and Reasoning (TIME), pp. 88–95. IEEE Computer Society Press (2009)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Undecidability of the logic of overlap relation over discrete linear orderings. Electron. Notes Theor. Comput. Sci. (ENTCS) 262, 65–81 (2010). Proc. of the 6th Workshop on Methods for Modalities (M4M-6 2009)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: The dark side of Interval Temporal Logic: sharpening the undecidability border. In: Proc. of the 18th Int. Symposium on Temporal Representation and Reasoning (TIME), pp. 131–138. IEEE Computer Society Press (2011)
Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableaux for logics of subinterval structures over dense orderings. Int. J. Log. Comput. 20, 133–166 (2010)
Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions. Ann. Pure Appl. Logic 161(3), 289–304 (2009)
Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: Optimal tableaux for right propositional neighborhood logic over linear orders. In: Proc. of the 11th European Conference on Logics in Artificial Intelligence (JELIA). LNAI, vol. 5293, pp. 62–75. Springer (2008)
Bresolin, D., Montanari, A., Sciavicco, G.: An optimal decision procedure for right propositional neighborhood logic. J. Autom. Reason. 38(1–3), 173–199 (2007)
Della Monica, D.: Expressiveness, decidability, and undecidability of interval temporal logic. Ph.D. thesis, University of Udine (2011). http://www.dia.unisa.it/dottorandi/dario.dellamonica/phdthesis.pdf. Last accessed on 8 August 2013
Goranko, V., Montanari, A., Sciavicco, G.: A road map of interval temporal logics and duration calculi. J. Appl. Non Classical Logics 14(1–2), 9–54 (2004)
Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. J. ACM 38(4), 935–962 (1991)
Harel, D.: Recurring dominoes: making the highly undecidable highly understandable. Ann. Discrete Math. 24, 51–72 (1985)
Interval temporal logics website. http://itl.dimi.uniud.it/content/logic-hs. Mantained by Dario Della Monica. Last accessed on 8 August 2013
Lautemann, C., Schwentick, T., Thérien, D.: Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds.) Proc. of the 8th International Workshop on Computer Science Logic (CSL-94). Lecture Notes in Computer Science, vol. 933, pp. 205–216. Springer Berlin Heidelberg (1995)
Lodaya, K.: Sharpening the undecidability of interval temporal logic. In: Proc. of the 6th Asian Computing Science Conference (ASIAN). LNCS, vol. 1961, pp. 290–298. Springer (2000)
Lodaya, K., Parikh, R., Ramanujam, R., Thiagarajan, P.S.: A logical study of distributed transition systems. Inf. Comput. 119(1), 91–118 (1995)
Marcinkowski, J., Michaliszyn, J.: The ultimate undecidability result for the Halpern–Shoham logic. In: Proc. of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 377–386. IEEE Computer Society (2011)
Marcinkowski, J., Michaliszyn, J., Kieronski, E.: B and D are enough to make the Halpern–Shoham logic undecidable. In: Proc. of the 37th International Colloquium on Automata, Languages, and Programming—Part II (ICALP-2). LNCS, vol. 6199, pp. 357–368 (2010)
Montanari, A., Puppis, G., Sala, P.: Maximal decidable fragments of Halpern and Shoham’s modal logic of intervals. In: Proc. of the 37th International Colloquium on Automata, Languages, and Programming—Part II (ICALP-2). LNCS, vol. 6199, pp. 345–356 (2010)
Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983)
Wang, H.: Proving theorems by pattern recognition II. Bell Systems Technical Journal 40(1), 1–41 (1961)
Zhou, C., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Inf. Process. Lett. 40(5), 269–276 (1991)
Author information
Authors and Affiliations
Corresponding author
Additional information
A short preliminary version of this paper appeared in [6].
Rights and permissions
About this article
Cite this article
Bresolin, D., Monica, D.D., Goranko, V. et al. The dark side of interval temporal logic: marking the undecidability border. Ann Math Artif Intell 71, 41–83 (2014). https://doi.org/10.1007/s10472-013-9376-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-013-9376-4