References

  1. Alessandro Abate, Julian Gutierrez, Lewis Hammond, Paul Harrenstein, Marta Kwiatkowska, Muhammad Najib, Giuseppe Perelli, Thomas Steeples & Michael J. Wooldridge (2021): Rational verification: game-theoretic verification of multi-agent systems. Appl. Intell. 51(9), pp. 6569–6584, doi:10.1007/s10489-021-02658-y.
  2. Natasha Alechina & Brian Logan (2020): State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems. In: Andreas Blass, Patrick Cégielski, Nachum Dershowitz, Manfred Droste & Bernd Finkbeiner: Fields of Logic and Computation III - Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday, Lecture Notes in Computer Science 12180. Springer, pp. 9–29, doi:10.1007/978-3-030-48006-6_2.
  3. Fahiem Bacchus & Froduald Kabanza (2000): Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116(1), pp. 123–191, doi:10.1016/S0004-3702(99)00071-5.
  4. Meghyn Bienvenu, Christian Fritz & Sheila A. McIlraith (2006): Planning with Qualitative Temporal Preferences. In: Patrick Doherty, John Mylopoulos & Christopher A. Welty: Proceedings, Tenth International Conference on Principles of Knowledge Representation and Reasoning, Lake District of the United Kingdom, June 2-5, 2006. AAAI Press, pp. 134–144.
  5. Nils Bulling & Valentin Goranko (2013): How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract). In: Fabio Mogavero, Aniello Murano & Moshe Y. Vardi: Proceedings 1st International Workshop on Strategic Reasoning, SR 2013, Rome, Italy, March 16-17, 2013, EPTCS 112, pp. 33–41, doi:10.4204/EPTCS.112.8.
  6. Alessandro Cimatti, Marco Pistore & Paolo Traverso (2008): Chapter 22 Automated Planning. In: Frank van Harmelen, Vladimir Lifschitz & Bruce Porter: Handbook of Knowledge Representation, Foundations of Artificial Intelligence 3. Elsevier, pp. 841–867, doi:10.1016/S1574-6526(07)03022-2.
  7. Rodica Condurache, Catalin Dima, Youssouf Oualhadj & Nicolas Troquard (2021): Rational Synthesis in the Commons with Careless and Careful Agents. In: Frank Dignum, Alessio Lomuscio, Ulle Endriss & Ann Nowé: AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021. ACM, pp. 368–376, doi:10.5555/3463952.3464000.
  8. Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini & Jean-François Raskin (2016): The Complexity of Rational Synthesis. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pp. 121:1–121:15, doi:10.4230/LIPIcs.ICALP.2016.121.
  9. Patrick Doherty & Jonas Kvarnstram (2001): TALplanner: A Temporal Logic-Based Planner. AI Magazine 22(3), pp. 95–102, doi:10.1609/aimag.v22i3.1581.
  10. Berndt Farwer (2002): ω-Automata. In: Erich Grädel, Wolfgang Thomas & Thomas Wilke: Automata Logics, and Infinite Games: A Guide to Current Research. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 3–21, doi:10.1007/3-540-36387-4_1.
  11. Dana Fisman, Orna Kupferman & Yoad Lustig (2010): Rational Synthesis. In: Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, pp. 190–204, doi:10.1007/978-3-642-12002-2_16.
  12. Orna Kupferman & Noam Shenwald (2022): The Complexity of LTL Rational Synthesis. In: Dana Fisman & Grigore Rosu: Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, Cham, pp. 25–45, doi:10.1007/978-3-030-99524-9_2.
  13. Marvin L. Minsky (1961): Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines. Annals of Mathematics 74(3), pp. 437–455, doi:10.2307/1970290.
  14. John F. Nash (1951): Non-Cooperative Games. The Annals of Mathematics 54, pp. 286–295, doi:10.2307/1969529.
  15. Hoang Nga Nguyen, Natasha Alechina, Brian Logan & Abdur Rakib (2018): Alternating-time temporal logic with resource bounds. J. Log. Comput. 28(4), pp. 631–663, doi:10.1093/logcom/exv034.
  16. Amir Pnueli (1977): The Temporal Logic of Programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977. IEEE Computer Society, pp. 46–57, doi:10.1109/SFCS.1977.32.
  17. Amir Pnueli & Roni Rosner (1989): On the Synthesis of a Reactive Module. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 11-13, 1989, pp. 179–190, doi:10.1145/75277.75293.
  18. Michael Ummels (2008): The Complexity of Nash Equilibria in Infinite Multiplayer Games. In: Roberto Amadio: Foundations of Software Science and Computational Structures. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 20–34, doi:10.1007/978-3-540-78499-9_3.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org