Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron & Pietro Sala (2017):
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption.
In: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn & Anca Muscholl: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland,
LIPIcs 80.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 120:1–120:14,
doi:10.4230/LIPIcs.ICALP.2017.120.
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron & Pietro 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.1305/ndjfl/1093635589.
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron & Pietro 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.
Laura Bozzelli, Angelo Montanari, Adriano Peron & Pietro Sala (2020):
On a Temporal Logic of Prefixes and Infixes.
In: Javier Esparza & Daniel Král': 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic,
LIPIcs 170.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 21:1–21:14,
doi:10.4230/LIPIcs.MFCS.2020.21.
Laura Bozzelli, Angelo Montanari, Adriano Peron & Pietro Sala (2021):
Pspace-completeness of the temporal logic of sub-intervals and suffixes.
To appear in: Carlo Combi, Johan Eder, and Mark Reynolds eds. proceedings of 28th International Symposium on Temporal Representation and Reasoning, TIME 2021, September 27-29, 2021, Klagenfurt, Austria, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala & Guido Sciavicco (2014):
Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity.
Theor. Comput. Sci. 560,
pp. 269–291,
doi:10.1016/j.tcs.2014.03.033.
Davide Bresolin, Angelo Montanari, Pietro Sala & Guido Sciavicco (2011):
Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders.
In: Kai Brünnler & George Metcalfe: Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Bern, Switzerland, July 4-8, 2011. Proceedings,
Lecture Notes in Computer Science 6793.
Springer,
pp. 73–87,
doi:10.1007/978-3-642-22119-4_8.
Peter van Emde Boas (1997):
The convenience of tilings.
CRC Press.
Valentin Goranko, Angelo Montanari & Guido 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.
Joseph Y. Halpern & Yoav Shoham (1991):
A Propositional Modal Logic of Time Intervals.
Journal of ACM 38(4),
pp. 935–962,
doi:10.1145/115234.115351.
Jerzy Marcinkowski & Jakub Michaliszyn (2014):
The Undecidability of the Logic of Subintervals.
Fundam. Inform. 131(2),
pp. 217–240,
doi:10.3233/FI-2014-1011.
Jerzy Marcinkowski, Jakub Michaliszyn & Emanuel Kieronski (2010):
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable.
In: Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis: Automata, Languages and Programming, 37th International Colloquium, ICALP, Bordeaux, France, July 6-10, Proceedings, Part II,
LNCS 6199.
Springer,
pp. 357–368,
doi:10.1007/978-3-642-14162-1_30.
Alberto Molinari, Angelo Montanari, Aniello Murano, Giuseppe Perelli & Adriano Peron (2016):
Checking interval properties of computations.
Acta Inf. 53(6-8),
pp. 587–619,
doi:10.1007/s00236-015-0250-1.
Angelo Montanari & Pietro Sala (2012):
An Optimal Tableau System for the Logic of Temporal Neighborhood over the Reals.
In: Ben C. Moszkowski, Mark Reynolds & Paolo Terenziani: 19th International Symposium on Temporal Representation and Reasoning, TIME 2012, Leicester, United Kingdom, September 12-14, 2012.
IEEE Computer Society,
pp. 39–46,
doi:10.1109/TIME.2012.18.
Sylvain Schmitz (2016):
Complexity Hierarchies Beyond Elementary.
ACM Transactions on Computation Theory 8(1),
pp. 3:1–3:36,
doi:10.1145/2858784.
Larry Joseph Stockmeyer (1974):
The complexity of decision problems in automata theory and logic..
Massachusetts Institute of Technology.
Yde 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