R. Alur & D. L. Dill (1994):
A theory of timed automata.
Theoretical Computer Science 126(2),
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
R. Alur, T. Feder & T. A. Henzinger (1996):
The Benefits of Relaxing Punctuality.
Journal of the ACM 43(1),
pp. 116–146,
doi:10.1145/227595.227602.
R. Alur & T. A. Henzinger (1993):
Real-Time Logics: Complexity and Expressiveness.
Information and Computation 104(1),
pp. 35–77,
doi:10.1006/inco.1993.1025.
R. Alur & T. A. Henzinger (1994):
A Really Temporal Logic.
Journal of the ACM 41(1),
pp. 181–204,
doi:10.1145/174644.174651.
J. Barreiro, M. Boyce, M. Do, J. Frank, M. Iatauro, T. Kichkaylo, P. Morris, J. Ong, E. Remolina, T. Smith & D. Smith (2012):
EUROPA: A Platform for AI Planning, Scheduling, Constraint Programming, and Optimization.
In: Proceedings of ICKEPS.
L. Bozzelli, A. Molinari, A. Montanari & A. Peron (2018):
Complexity of timeline-based planning over dense temporal domains: exploring the middle ground.
Technical Report 2/2018.
University of Udine,
Italy.
Available at https://www.dimi.uniud.it/assets/preprints/2-2018-molinari.pdf.
L. Bozzelli, A. Molinari, A. Montanari, A. Peron & G. Woeginger (2018):
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.
In: Proceedings of ICTCS.
A. Cesta, G. Cortellessa, S. Fratini, A. Oddi & N. Policella (2007):
An Innovative Product for Space Mission Planning: An A Posteriori Evaluation.
In: Proceedings of ICAPS,
pp. 57–64.
S. Chien, D. Tran, G. Rabideau, S.R. Schaffer, D. Mandl & S. Frye (2010):
Timeline-Based Space Operations Scheduling with External Constraints.
In: Proceedings of ICAPS,
pp. 34–41.
M. Cialdea Mayer, A. Orlandini & A. Umbrico (2016):
Planning and Execution with Flexible Timelines: a Formal Account.
Acta Informatica 53(6–8),
pp. 649–680,
doi:10.1007/s00236-015-0252-z.
S. Demri & R. Lazic (2009):
LTL with the freeze quantifier and register automata.
ACM Transactions on Computational Logic 10(3),
pp. 16:1–16:30,
doi:10.1145/1507244.1507246.
J. Frank & A. Jónsson (2003):
Constraint-based Attribute and Interval Planning.
Constraints 8(4),
pp. 339–364,
doi:10.1023/A:1025842019552.
N. Gigante, A. Montanari, M. Cialdea Mayer & A. Orlandini (2016):
Timelines are Expressive Enough to Capture Action-Based Temporal Planning.
In: Proceedings of TIME,
pp. 100–109,
doi:10.1109/TIME.2016.18.
N. Gigante, A. Montanari, M. Cialdea Mayer & A. Orlandini (2017):
Complexity of Timeline-Based Planning.
In: Proceedings of ICAPS,
pp. 116–124.
D. Harel (1992):
Algorithmics: The spirit of computing,
2nd edition.
Wesley.
A. K. Jónsson, P. H. Morris, N. Muscettola, K. Rajan & B. D. Smith (2000):
Planning in Interplanetary Space: Theory and Practice.
In: Proceedings of ICAPS,
pp. 177–186.
R. Koymans (1990):
Specifying Real-Time Properties with Metric Temporal Logic.
Real-Time Systems 2(4),
pp. 255–299,
doi:10.1007/BF01995674.
N. Muscettola (1994):
HSTS: Integrating Planning and Scheduling.
In: Intelligent Scheduling.
Morgan Kaufmann,
pp. 169–212.
J. Ouaknine & J. Worrell (2007):
On the decidability and complexity of Metric Temporal Logic over finite words.
Logical Methods in Computer Science 3(1),
doi:10.2168/LMCS-3(1:8)2007.
C. M. Papadimitriou (1994):
Computational complexity.
Addison-Wesley,
Reading, Massachusetts.
eptcs@eptcs.org