1. J. F. Allen (1983): Maintaining Knowledge about Temporal Intervals. Communications of the ACM 26(11), pp. 832–843, doi:10.1145/182.358434.
  2. L. Bozzelli, H. van Ditmarsch & S. Pinchinat (2015): The Complexity of One-agent Refinement Modal Logic. Theoretical Computer Science 603(C), pp. 58–83, doi:10.1016/j.tcs.2015.07.015.
  3. L. Bozzelli, A. Molinari, A. Montanari & A. Peron (2017): An in-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions. In: SEFM. Available at
  4. L. Bozzelli, A. Molinari, A. Montanari & A. Peron (2017): On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions. Technical Report. University of Udine, Italy. Available at
  5. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2016): Interval Temporal Logic Model Checking: the Border Between Good and Bad HS Fragments. In: IJCAR, LNAI 9706, pp. 389–405, doi:10.1007/978-3-319-40229-1_27.
  6. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2016): Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. In: FSTTCS, pp. 26:1–14, doi:10.4230/LIPIcs.FSTTCS.2016.26.
  7. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2016): Model Checking the Logic of Allen's Relations Meets and Started-by is ^-Complete. In: GandALF, pp. 76–90, doi:10.4204/EPTCS.226.6.
  8. D. Bresolin, D. Della Monica, V. Goranko, A. Montanari & G. Sciavicco (2014): The dark side of interval temporal logic: marking the undecidability border. Annals of Mathematics and Artificial Intelligence 71(1-3), pp. 41–83, doi:10.1007/s10472-013-9376-4.
  9. A. K. Chandra, D. C. Kozen & L. J. Stockmeyer (1981): Alternation. Journal of the ACM 28(1), pp. 114–133, doi:10.1145/322234.322243.
  10. E. A. Emerson & J. Y. Halpern (1986): ``Sometimes'' and ``not never'' revisited: on branching versus linear time temporal logic. Journal of the ACM 33(1), pp. 151–178, doi:10.1145/4904.4999.
  11. J. Ferrante & C. Rackoff (1975): A Decision Procedure for the First Order Theory of Real Addition with Order. SIAM Journal of Computation 4(1), pp. 69–76, doi:10.1137/0204006.
  12. F. Giunchiglia & P. Traverso (1999): Planning as Model Checking. In: ECP, LNCS 1809. Springer, pp. 1–20, doi:10.1007/10720246_1.
  13. J. Y. Halpern & Y. Shoham (1991): A Propositional Modal Logic of Time Intervals. Journal of the ACM 38(4), pp. 935–962, doi:10.1145/115234.115351.
  14. S. C. Kleene (1956): Representation of Events in Nerve Nets and Finite Automata. In: Automata Studies 34. Princeton University Press, pp. 3–41.
  15. A. Lomuscio & J. Michaliszyn (2013): An Epistemic Halpern-Shoham Logic. In: IJCAI, pp. 1010–1016. Available at
  16. A. Lomuscio & J. Michaliszyn (2014): Decidability of model checking multi-agent systems against a class of EHS specifications. In: ECAI, pp. 543–548, doi:10.3233/978-1-61499-419-0-543.
  17. A. Lomuscio & J. Michaliszyn (2016): Model Checking Multi-agent Systems Against Epistemic HS Specifications with Regular Expressions. In: KR. AAAI Press, pp. 298–307.
  18. A. Lomuscio & F. Raimondi (2006): MCMAS: A Model Checker for Multi-agent Systems. In: TACAS, LNCS 3920. Springer, pp. 450–454, doi:10.1007/11691372_31.
  19. J. Marcinkowski & J. Michaliszyn (2014): The Undecidability of the Logic of Subintervals. Fundamenta Informaticae 131(2), pp. 217–240, doi:10.3233/FI-2014-1011.
  20. A. Molinari, A. Montanari, A. Murano, G. Perelli & A. Peron (2016): Checking interval properties of computations. Acta Informatica, doi:10.1007/s00236-015-0250-1.
  21. A. Molinari, A. Montanari & A. Peron (2015): Complexity of ITL model checking: some well-behaved fragments of the interval logic HS. In: TIME, pp. 90–100, doi:10.1109/TIME.2015.12.
  22. A. Molinari, A. Montanari & A. Peron (2015): A Model Checking Procedure for Interval Temporal Logics based on Track Representatives. In: CSL, pp. 193–210, doi:10.4230/LIPIcs.CSL.2015.193.
  23. A. Molinari, A. Montanari, A. Peron & P. Sala (2016): Model Checking Well-Behaved Fragments of HS: the (Almost) Final Picture. In: KR, pp. 473–483.
  24. B. Moszkowski (1983): Reasoning About Digital Circuits. Stanford University, CA.
  25. A. Pnueli (1977): The temporal logic of programs. In: FOCS. IEEE, pp. 46–57, doi:10.1109/SFCS.1977.32.
  26. I. Pratt-Hartmann (2005): Temporal prepositions and their logic. Artificial Intelligence 166(1-2), pp. 1–36, doi:10.1016/j.artint.2005.04.003.
  27. P. Roeper (1980): Intervals and Tenses. J. Philosophical Logic 9, pp. 451–469, doi:10.1007/BF00262866.
  28. Y. Venema (1990): Expressiveness and Completeness of an Interval Tense Logic. Notre Dame Journal of Formal Logic 31(4), pp. 529–547, doi:10.1305/ndjfl/1093635589.

Comments and questions to:
For website issues: