Abstract
Interval temporal logics take time intervals, instead of time instants, as their primitive temporal entities. One of the most studied interval temporal logics is Halpern and Shoham’s modal logic of time intervals HS, which associates a modal operator with each binary relation between intervals over a linear order (the so-called Allen’s interval relations). A complete classification of all HS fragments with respect to their relative expressive power has been recently given for the classes of all linear orders and of all dense linear orders. The cases of discrete and finite linear orders turn out to be much more involved. In this paper, we make a significant step towards solving the classification problem over those classes of linear orders. First, we illustrate various non-trivial temporal properties that can be expressed by HS fragments when interpreted over finite and discrete linear orders; then, we provide a complete set of definabilities for the HS modalities corresponding to the Allen’s relations meets, later, begins, finishes, and during, as well as the ones corresponding to their inverse relations. The only missing cases are those of the relations overlaps and overlapped by.
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
Aceto, L., Della Monica, D., Ingólfsdóttir, A., Montanari, A., Sciavicco, G.: An algorithm for enumerating maximal models of horn theories with an application to modal logics. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 1–17. Springer, Heidelberg (2013)
Aceto, L., Della Monica, D., Ingólfsdóttir, A., Montanari, A., Sciavicco, G.: A complete classification of the expressiveness of interval logics of Allen’s relations over dense linear orders. In: Proc. of the 20th TIME, pp. 65–72. IEEE Computer Society (2013)
Aceto, L., Della Monica, D., Ingólfsdóttir, A., Montanari, A., Sciavicco, G.: On the expressiveness of the interval logic of Allen’s relations over finite and discrete linear orders (extended version) (2014), http://www.di.unisa.it/dottorandi/dario.dellamonica/temp/expr_disc_ext.pdf
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Allen, J.F.: Towards a general theory of action and time. Artificial Intelligence 23(2), 123–154 (1984)
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., 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 TIME, pp. 131–138 (2011)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Metric propositional neighborhood interval logics on natural numbers. Software and Systems Modeling 12(2), 245–264 (2013)
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: Interval Temporal Logics over finite linear orders: the complete picture. In: Proc. of the 20th ECAI, pp. 199–204 (2012)
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: Interval Temporal Logics over strongly discrete linear orders: the complete picture. In: Proc. of the 3rd GandALF, pp. 155–168 (2012)
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., Montanari, A., Sala, P., Sciavicco, G.: What’s decidable about Halpern and Shoham’s interval logic? The maximal fragment \(\mathsf{A B \overline{B}\overline{L}}\). In: Proc. of the 26th LICS, pp. 387–396 (2011)
Bresolin, D., Sala, P., Sciavicco, G.: On Begins, Meets, and Before. International Journal on Foundations of Computer Science 23(3), 559–583 (2012)
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity. Theoretical Computer Science (2014) (online first since April 2014)
Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Expressiveness of the interval logics of Allen’s relations on the class of all linear orders: Complete classification. In: Proc. of the 22nd IJCAI, pp. 845–850 (July 2011)
Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Interval temporal logics: a journey. Bulletin of the European Association for Theoretical Computer Science 105, 73–99 (2011)
Goranko, V., Otto, M.: Model theory of modal logic. In: Blackburn, P., van Benthem, J.F.A.K., Wolter, F. (eds.) Handbook of Modal Logic, pp. 249–329. Elsevier (2007)
Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935–962 (1991)
Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), 137–161 (1985)
Marcinkowski, J., Michaliszyn, J.: The ultimate undecidability result for the Halpern-Shoham logic. In: Proc. of the 26th LICS, pp. 377–386. IEEE Computer Society (2011)
Milner, R.: A Calculus of Communicating Systems. Springer (1980)
Montanari, A., Puppis, G., Sala, P.: 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.) ICALP 2010. LNCS, vol. 6199, pp. 345–356. Springer, Heidelberg (2010)
Montanari, A., Puppis, G., Sala, P., Sciavicco, G.: Decidability of the interval temporal logic \(\mathsf{A B \overline{B}}\) over the natural numbers. In: Proc. of the 27th STACS, pp. 597–608 (2010)
Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University (1983)
Pratt-Hartmann, I.: Temporal prepositions and their logic. Artificial Intelligence 166(1-2), 1–36 (2005)
Venema, Y.: Expressiveness and completeness of an interval tense logic. Notre Dame Journal of Formal Logic 31(4), 529–547 (1990)
Zhou, C., Hansen, M.R.: Duration Calculus: A formal approach to real-time systems. EATCS Monographs in Theoretical Computer Science. Springer (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Aceto, L., Della Monica, D., Ingólfsdóttir, A., Montanari, A., Sciavicco, G. (2014). On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-11558-0_19
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11557-3
Online ISBN: 978-3-319-11558-0
eBook Packages: Computer ScienceComputer Science (R0)