References

  1. Rajeev Alur, Thomas A. Henzinger & Orna Kupferman (2002): Alternating-time temporal logic. J. ACM 49(5), pp. 672–713, doi:10.1145/585265.585270.
  2. Sara Bernardini & David E. Smith (2007): Developing Domain-Independent Search Control for Europa2. In: Proceedings of the ICAPS 2007 Workshop on Heuristics for Domain-Independent Planning.
  3. Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron & Gerhard J. Woeginger (2020): Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813, pp. 305–326, doi:10.1016/j.tcs.2019.12.030.
  4. Amedeo Cesta, Gabriella Cortellessa, Michel Denis, Alessandro Donati, Simone Fratini, Angelo Oddi, Nicola Policella, Erhard Rabenau & Jonathan Schulster (2007): Mexar2: AI Solves Mission Planner Problems. IEEE Intelligent Systems 22(4), pp. 12–19, doi:10.1109/MIS.2007.75.
  5. Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi & Nicola Policella (2006): Software Companion: The Mexar2 Support to Space Mission Planners. In: Gerhard Brewka, Silvia Coradeschi, Anna Perini & Paolo Traverso: Proceedings of the 17th European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications 141. IOS Press, pp. 622–626.
  6. S. Chien, G. Rabideau, R. Knight, R. Sherwood, B. Engelhardt, D. Mutz, T. Estlin, B. Smith, F. Fisher, T. Barrett, G. Stebbins & D. Tran (2000): ASPEN - Automating Space Mission Operations using Automated Planning and Scheduling. In: Proceedings of the International Conference on Space Operations.
  7. Steve A. Chien, Gregg Rabideau, Daniel Tran, Martina Troesch, Joshua Doubleday, Federico Nespoli, Miguel Perez Ayucar, Marc Costa Sitja, Claire Vallat, Bernhard Geiger, Nico Altobelli, Manuel Fernandez, Fran Vallejo, Rafael Andres & Michael Kueppers (2015): Activity-Based Scheduling of Science Campaigns for the Rosetta Orbiter. In: Qiang Yang & Michael Wooldridge: Proceedings of the 24th International Joint Conference on Artificial Intelligence. AAAI Press, pp. 4416–4422. Available at http://ijcai.org/Abstract/15/655.
  8. Marta Cialdea Mayer, Andrea Orlandini & Alessandro 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.
  9. Dario Della Monica, Nicola Gigante, Angelo Montanari & Pietro Sala (2018): A Novel Automata-Theoretic Approach to Timeline-Based Planning. In: Michael Thielscher, Francesca Toni & Frank Wolter: Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press, pp. 541–550. Available at https://aaai.org/ocs/index.php/KR/KR18/paper/view/18024.
  10. Dario Della Monica, Nicola Gigante, Angelo Montanari, Pietro Sala & Guido Sciavicco (2017): Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints. In: Carles Sierra: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 1008–1014, doi:10.24963/ijcai.2017/140.
  11. Dario Della Monica, Nicola Gigante, Salvatore La Torre & Angelo Montanari (2020): Complexity of Qualitative Timeline-Based Planning. In: Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, LIPIcs 178, pp. 16:1–16:13, doi:10.4230/LIPIcs.TIME.2020.16.
  12. David L. Dill (1989): Timing Assumptions and Verification of Finite-State Concurrent Systems. In: Joseph Sifakis: Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407. Springer, pp. 197–212, doi:10.1007/3-540-52148-8_17.
  13. Jeremy Frank & Ari K. Jónsson (2003): Constraint-Based Attribute and Interval Planning. Constraints 8(4), pp. 339–364, doi:10.1023/A:1025842019552.
  14. Simone Fratini, Amedeo Cesta, Andrea Orlandini, Riccardo Rasconi & Riccardo De Benedictis (2011): APSI-based Deliberation in Goal Oriented Autonomous Controllers. In: ASTRA 2011 11. ESA.
  15. Nicola Gigante (2019): Timeline-based Planning: Expressiveness and Complexity. University of Udine, Italy. Available on arXiv at: https://arxiv.org/abs/1902.06123.
  16. Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer & Andrea Orlandini (2016): Timelines Are Expressive Enough to Capture Action-Based Temporal Planning. In: Curtis E. Dyreson, Michael R. Hansen & Luke Hunsberger: Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning. IEEE Computer Society, pp. 100–109, doi:10.1109/TIME.2016.18.
  17. Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer & Andrea Orlandini (2017): Complexity of Timeline-Based Planning. In: Laura Barbulescu, Jeremy Frank, Mausam & Stephen F. Smith: Proceedings of the 27th International Conference on Automated Planning and Scheduling. AAAI Press, pp. 116–124. Available at https://aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/view/15758.
  18. Nicola Gigante, Angelo Montanari, Andrea Orlandini, Marta Cialdea Mayer & Mark Reynolds (2020): On timeline-based games and their complexity. Theor. Comput. Sci. 815, pp. 247–269, doi:10.1016/j.tcs.2020.02.011.
  19. Nicola Muscettola (1994): HSTS: Integrating Planning and Scheduling. In: Monte Zweben & Mark S. Fox: Intelligent Scheduling, chapter 6. Morgan Kaufmann, pp. 169–212.
  20. Mathias Péron & Nicolas Halbwachs (2007): An abstract domain extending difference-bound matrices with disequality constraints. In: International Workshop on Verification, Model Checking, and Abstract Interpretation. Springer, pp. 268–282, doi:10.1007/978-3-540-69738-1_20.
  21. Wolfgang Thomas (2008): Solution of Church's Problem: A tutorial. New Perspectives on Games and Interaction. Texts on Logic and Games 5.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org