References

  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. R. Alur, K. Etessami, S. La Torre & D.A.. Peled (2001): Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2(3), pp. 388–407, doi:10.1145/377978.377990.
  3. L. Bozzelli & R. Lanotte (2010): Complexity and succinctness issues for linear-time hybrid logics. Theor. Comput. Sci. 411(2), pp. 454–469, doi:10.1016/j.tcs.2009.08.009.
  4. L. Bozzelli, A. Molinari, A. Montanari & A. Peron (2020): Model checking interval temporal logics with regular expressions. Information and Computation 272, pp. 104498, doi:10.1016/j.ic.2019.104498.
  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: Proc. 8th IJCAR, LNAI 9706. Springer, pp. 389–405, doi:10.1007/978-3-319-40229-1_27.
  6. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2018): Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy. Information and Computation 262(Part), pp. 241–264, doi:10.1016/j.ic.2018.09.006.
  7. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2019): Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison. ACM Trans. Comput. Log. 20(1), pp. 4:1–4:31, doi:10.1145/3281028.
  8. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2019): Which fragments of the interval temporal logic HS are tractable in model checking?. Theor. Comput. Sci. 764, pp. 125–144, doi:10.1016/j.tcs.2018.04.011.
  9. L. Bozzelli, A. Molinari, A. Montanari, A. Peron & P. Sala (2022): Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. Log. Methods Comput. Sci. 18(1), doi:10.46298/lmcs-18(1:24)2022.
  10. L. Bozzelli, A. Montanari & A. Peron (2021): Complexity analysis of a unifying algorithm for model checking interval temporal logic. Inf. Comput. 280, pp. 104640, doi:10.1016/j.ic.2020.104640.
  11. L. Bozzelli, A. Montanari, A. Peron & P. Sala (2021): Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete. In: Proc. 12th GandALF, EPTCS 346, pp. 179–194, doi:10.4204/EPTCS.346.12.
  12. L. Bozzelli, A. Montanari, A. Peron & P. Sala (2021): Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. In: Proc. 28th TIME, LIPIcs 206. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 9:1–9:19, doi:10.4230/LIPIcs.TIME.2021.9.
  13. 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.
  14. D. Bresolin, A. Montanari, P. Sala & G. Sciavicco (2011): Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders. In: Proc. 20th TABLEAUX, LNCS 6973. Springer, pp. 73–87, doi:10.1007/978-3-642-22119-4_8.
  15. E.M. Clarke & E.A. Emerson (1981): Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In: Proc. Logics of Programs, LNCS 131, pp. 52–71, doi:10.1007/BFb0025774.
  16. 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.
  17. K. Etessami, M.Y. Vardi & T. Wilke (2002): First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179(2), pp. 279–295, doi:10.1006/inco.2001.2953.
  18. M. Franceschet, M. de Rijke & B.H. Schlingloff (2003): Hybrid Logics on Linear Structures: Expressivity and Complexity. In: Proc. 10th TIME-ICTL. IEEE Computer Society, pp. 166–173, doi:10.1109/TIME.2003.1214893.
  19. B. Di Giampaolo, S. La Torre & M. Napoli (2010): Parametric Metric Interval Temporal Logic. In: Proc. 4th LATA, LNCS 6031. Springer, pp. 249–260, doi:10.1007/978-3-642-13089-2_21.
  20. 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.
  21. J.A.W. Kamp (1968): Tense logic and the theory of linear order. University of California, Los Angeles.
  22. R. Koymans (1990): Specifying Real-Time Properties with Metric Temporal Logic. Real Time Syst. 2(4), pp. 255–299, doi:10.1007/BF01995674.
  23. O. Kupferman, N. Piterman & M.Y. Vardi (2009): From liveness to promptness. Formal Methods Syst. Des. 34(2), pp. 83–103, doi:10.1007/s10703-009-0067-z.
  24. K. Lodaya (2000): Sharpening the Undecidability of Interval Temporal Logic. In: Proc. 6th ASIAN, LNCS 1961. Springer, pp. 290–298, doi:10.1007/3-540-44464-5_21.
  25. A. Lomuscio & J. Michaliszyn (2013): An Epistemic Halpern-Shoham Logic. In: Proc. 23rd IJCAI. IJCAI/AAAI, pp. 1010–1016.
  26. A. Lomuscio & J. Michaliszyn (2014): Decidability of model checking multi-agent systems against a class of EHS specifications. In: Proc. 21st ECAI. IOS Press, pp. 543–548, doi:10.3233/978-1-61499-419-0-543.
  27. A. Lomuscio & J. Michaliszyn (2016): Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions. In: Proc. 15th KR. AAAI Press, pp. 298–308. Available at http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12823.
  28. 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.
  29. A. Molinari, A. Montanari, A. Murano, G. Perelli & A. Peron (2016): Checking interval properties of computations. Acta Informatica 53(6-8), pp. 587–619, doi:10.1007/s00236-015-0250-1.
  30. Alberto Molinari, Angelo Montanari, Adriano Peron & Pietro Sala (2016): Model Checking Well-Behaved Fragments of HS: The (Almost) Final Picture. In: Chitta Baral, James P. Delgrande & Frank Wolter: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016. AAAI Press, pp. 473–483. Available at http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12792.
  31. A. Montanari, G. Puppis & P. Sala (2015): A decidable weakening of Compass Logic based on cone-shaped cardinal directions. Logical Methods in Computer Science 11(4), doi:10.2168/LMCS-11(4:7)2015.
  32. B. Moszkowski (1983): Reasoning About Digital Circuits. Dept. of Computer Science, Stanford University, Stanford, CA.
  33. A. Pnueli (1977): The temporal logic of programs. In: Proc. 18th FOCS. IEEE Computer Society, pp. 46–57, doi:10.1109/SFCS.1977.32.
  34. I. Pratt-Hartmann (2005): Temporal propositions and their logic. Artificial Intelligence 166(1-2), pp. 1–36, doi:10.1016/j.artint.2005.04.003.
  35. J.P. Queille & J. Sifakis (1982): Specification and verification of concurrent programs in CESAR. In: Proc. 5th SP, LNCS 137. Springer, pp. 337–351, doi:10.1007/3-540-11494-7_22.
  36. P. Roeper (1980): Intervals and Tenses. Journal of Philosophical Logic 9, pp. 451–469.
  37. T. Schwentick & V. Weber (2007): Bounded-Variable Fragments of Hybrid Logics. In: Proc. 24th STACS, LNCS 4393 4393. Springer, pp. 561–572, doi:10.1007/978-3-540-70918-3_48.
  38. 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: eptcs@eptcs.org
For website issues: webmaster@eptcs.org