J. F. Allen (1983):
Maintaining Knowledge about Temporal Intervals.
Communications of the ACM 26(11),
pp. 832–843,
doi:10.1145/182.358434.
P. Blackburn, M. de Rijke & Y. Venema (2002):
Modal Logic.
Cambridge University Press.
P. Bouyer, N. Markey, J. Ouaknine, P. Schnoebelen & J. Worrell (2008):
On Termination for Faulty Channel Machines.
In: Proc. of the 29th STACS,
pp. 121–132,
doi:10.4230/LIPIcs.STACS.2008.1339.
D. Bresolin, D. Della Monica, V. Goranko, A. Montanari & G. Sciavicco (2008):
Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification.
In: Proc. of the 15th LPAR,
LNCS 5330.
Springer,
pp. 590–604,
doi:10.1007/978-3-540-89439-1_41.
D. Bresolin, V. Goranko, A. Montanari & G. Sciavicco (2009):
Propositional Interval Neighborhood Logics: Expressiveness, Decidability, and Undecidable Extensions.
Annals of Pure and Applied Logic 161(3),
pp. 289–304,
doi:10.1016/j.apal.2009.07.003.
D. Bresolin, D. Della Monica, V. Goranko, A. Montanari & G. Sciavicco (2011):
The Dark Side of Interval Temporal Logic: Sharpening the Undecidability Border.
In: Proc. of the 18th TIME,
pp. 131–138,
doi:10.1109/TIME.2011.21.
D. Bresolin, D. Della Monica, A. Montanari, P. Sala & G. Sciavicco (2012):
Interval Temporal Logics over Finite Linear Orders: The Complete Picture.
In: Proc. of the 20th ECAI.
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. of the 20th TABLEAUX,
LNCS 6793.
Springer,
pp. 73–87,
doi:10.1007/978-3-642-22119-4_8.
D. Bresolin, A. Montanari & G. Sciavicco (2007):
An optimal decision procedure for Right Propositional Neighborhood Logic.
Journal of Automated Reasoning 38(1-3),
pp. 173–199,
doi:10.1007/s10817-006-9051-0.
D. Bresolin, P. Sala & G. Sciavicco (2012):
On Begins, Meets, and Before.
International Journal on Foundations of Computer Science 23(3),
pp. 559–583,
doi:10.1142/S012905411240028X.
D. Della Monica, V. Goranko, A. Montanari & G. Sciavicco (2011):
Expressiveness of the Interval Logics of Allens Relations on the Class of All Linear Orders: Complete Classification.
In: Proc. of the 20th IJCAI,
pp. 845–850.
S. Demri & R. Lazic (2006):
LTL with the Freeze Quantifier and Register Automata.
In: Proc. of the 21st LICS.
IEEE Computer Society,
pp. 17–26,
doi:10.1109/LICS.2006.31.
V. Goranko, A. Montanari & G. Sciavicco (2003):
Propositional interval neighborhood temporal logics.
Journal of Universal Computer Science 9(9),
pp. 1137–1167,
doi:10.3217/jucs-009-09-1137.
V. Goranko, A. Montanari & G. Sciavicco (2004):
A road map of interval temporal logics and duration calculi.
Journal of Applied Non-Classical Logics 14(1–2),
pp. 9–54,
doi:10.3166/jancl.14.9-54.
J. 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.
J. Marcinkowski & J. Michaliszyn (2011):
The Ultimate Undecidability Result for the Halpern-Shoham Logic.
In: Proc. of the 26th LICS.
IEEE Computer Society,
pp. 377–386,
doi:10.1109/LICS.2011.21.
R. Mayr (2003):
Undecidable problems in unreliable computations.
Theoretical Computer Science 297(1–3),
pp. 337–354,
doi:10.1016/S0304-3975(02)00646-1.
A. Montanari, G. Puppis & P. Sala (2010):
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals.
In: Proc. of the 37th ICALP,
LNCS 6199.
Springer,
pp. 345–356,
doi:10.1007/978-3-642-14162-1_29.
A. Montanari, G. Puppis, P. Sala & G. Sciavicco (2010):
Decidability of the Interval Temporal Logic ABB over the Natural Numbers.
In: Proc. of the 31st STACS,
pp. 597–608,
doi:10.4230/LIPIcs.STACS.2010.2488.
P. Sala (2010):
Decidability of Interval Temporal Logics.
University of Udine.
P. Van Emde Boas (1997):
The Convenience of Tilings.
In: Complexity, Logic and Recursion Theory,
Lecture Notes in Pure and Applied Mathematics 187.
Marcel Dekker Inc.,
pp. 331–363.
Y. Venema (1991):
A modal logic for chopping intervals.
Journal of Logic and Computation 1(4),
pp. 453–476,
doi:10.1093/logcom/1.4.453.
eptcs@eptcs.org