Abstract
In this paper, we focus our attention on the fragment of Halpern and Shoham’s modal logic of intervals (HS) that features four modal operators corresponding to the relations “meets”, “met by”, “begun by”, and “begins” of Allen’s interval algebra (\(A\bar{A}B\bar{B}\) logic). \(A\bar{A}B\bar{B}\) properly extends interesting interval temporal logics recently investigated in the literature, such as the logic \(B\bar{B}\) of Allen’s “begun by/begins” relations and propositional neighborhood logic \(A\bar{A}\), in its many variants (including metric ones). We prove that the satisfiability problem for \(A\bar{A}B\bar{B}\), interpreted over finite linear orders, is decidable, but not primitive recursive (as a matter of fact, \(A\bar{A}B\bar{B}\) turns out to be maximal with respect to decidability). Then, we show that it becomes undecidable when \(A\bar{A}B\bar{B}\) is interpreted over classes of linear orders that contains at least one linear order with an infinitely ascending sequence, thus including the natural time flows ℕ, ℤ, ℚ, and ℝ.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the Association for Computing Machinery 26(11), 832–843 (1983)
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.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 590–604. Springer, Heidelberg (2008)
Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions. Annals of Pure and Applied Logic 161(3), 289–304 (2009)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Robinson, C., Sciavicco, G.: Metric Propositional Neighborhood Logics. Research Report UDMI/2010/02, Dept. of Mathematics and Computer Science, University of Udine (2010), http://users.dimi.uniud.it/~angelo.montanari/rr201002.pdf
Bresolin, D., Montanari, A., Sala, P.: An optimal tableau-based decision algorithm for Propositional Neighborhood Logic. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 549–560. Springer, Heidelberg (2007)
Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: Tableau-based decision procedures for Propositional Neighborhood Logic. Research Report UDMI/2010/01, Dept. of Mathematics and Computer Science, University of Udine (2010), http://users.dimi.uniud.it/~angelo.montanari/rr201001.pdf
Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: Right propositional neighborhood logic over natural numbers with integer constraints for interval lengths. In: Proc. of the 7th IEEE Int. Conference on Software Engineering and Formal Methods (SEFM), pp. 240–249. IEEE Comp. Society Press, Los Alamitos (2009)
Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood temporal logics. Journal of Universal Computer Science 9(9), 1137–1167 (2003)
Goranko, V., Montanari, A., Sciavicco, G.: A road map of interval temporal logics and duration calculi. Applied Non-classical Logics 14(1-2), 9–54 (2004)
Halpern, J.Y., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38, 279–292 (1991)
Kamp, H., Reyle, U.: From Discourse to Logic: Introduction to Model-theoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory. Studies in Linguistics and Philosophy, vol. 42. Springer, Heidelberg (1993)
Lodaya, K.: Sharpening the undecidability of interval temporal logic. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 290–298. Springer, Heidelberg (2000)
Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science 297(1-3), 337–354 (2003)
Montanari, A., Puppis, G., Sala, P.: A decidable spatial logic with cone-shaped cardinal directions. In: Grädel, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 394–408. Springer, Heidelberg (2009)
Montanari, A., Puppis, G., Sala, P.: Maximal decidable fragments of Halpern and Shoham’s modal logic of intervals. Research Report UDMI/2010/04, Dept. of Mathematics and Computer Science, University of Udine (2010), http://users.dimi.uniud.it/~angelo.montanari/rr201004.pdf
Montanari, A., Puppis, G., Sala, P., Sciavicco, G.: Decidability of the interval temporal logic AB\(\bar{B}\) over the natural numbers. In: Proc. of the 27th Int. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 597–608 (to appear, 2010)
Otto, M.: Two variable first-order logic over ordered domains. Journal of Symbolic Logic 66(2), 685–702 (2001)
Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1), 1–27 (2007)
Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251–261 (2002)
Venema, Y.: Two-dimensional modal logics for relation algebras and temporal logic of intervals. ITLI prepublication series LP-89-03, University of Amsterdam (1989)
Venema, Y.: A modal logic for chopping intervals. Journal of Logic and Computation 1(4), 453–476 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montanari, A., Puppis, G., Sala, P. (2010). Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)