Abstract
The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We contribute to this effort by showing (among other results), that the BD fragment (where only the operators “begins” and “during” are allowed) is undecidable over discrete structures.
This is a preview of subscription content, log in via an institution to check access.
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 ACM 26(11), 832–843 (1983)
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)
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., DellaMonica, D., Goranko, V., Montanari, A., Sciavicco, G.: Undecidability of Interval Temporal Logics with the Overlap Modality. In: Proc. of 16th International Symposium on Temporal Representation and Reasoning - TIME 2009, pp. 88–95. IEEE Computer Society Press, Los Alamitos (2009)
Bresolin, D., DellaMonica, D., Goranko, V., Montanari, A., Sciavicco, G.: Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings. In: Proceedings of M4M 6: 6th Workshop on Methods for Modalities (November 2009)
Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau-based decision procedures for the logics of subinterval structures over dense orderings. Journal of Logic and Computation 20(1), 133–166 (2010)
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., Montanari, A., Sala, P., Sciavicco, G.: Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 62–75. Springer, Heidelberg (2008)
Goranko, V., Montanari, A., Sciavicco, G.: A road map of interval temporal logics and duration calculi. Journal of Applied Non-Classical Logics 14(1-2), 9–54 (2004)
Hamblin, C.L.: Instants and intervals. Studium Generale 27, 127–134 (1971)
Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935–962 (1991)
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)
Moszkowski, B.C.: Reasoning about Digital Circuits. PhD thesis, Stanford University, Computer Science Department (July 1983)
Montanari, A., Puppis, G., Sala, P., Sciavicco, G.: Decidability of the Interval Temporal Logic AB\(\bar{B}\) on Natural Numbers. In: Proc. of the 27th Symposium on Theoretical Aspects of Computer Science (STACS 2010), pp. 597–608 (2010)
Parikh, R.: A decidability result for second order process logic. In: Proc. 19th FOCS, pp. 177–183. IEEE, Los Alamitos (October 1978)
Pnueli, A.: A temporal logic of programs. In: Proc. 18th FOCS, pp. 46–57. IEEE, Los Alamitos (1977)
Pratt, V.R.: Process logic. In: Proc. 6th POPL, pp. 93–100. ACM, New York (1979)
Prior, A.N.: Past, Present and Future. Clarendon Press, Oxford (1967)
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
Marcinkowski, J., Michaliszyn, J., Kieroński, E. (2010). B and D Are Enough to Make the Halpern–Shoham Logic Undecidable. 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_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_30
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)