References

  1. Benjamin Andres, David Rajaratnam, Orkunt Sabuncu & Torsten Schaub (2015): Integrating ASP into ROS for Reasoning in Robots. In: Proceedings of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning 9345. Springer, Lexington, Kentucky, pp. 69–82, doi:10.1007/978-3-319-23264-5_7.
  2. Max Barer, Guni Sharon, Roni Stern & Ariel Felner (2014): Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. In: Seventh Annual Symposium on Combinatorial Search, doi:10.3233/978-1-61499-419-0-961.
  3. Simona Citrigno, Thomas Eiter, Wolfgang Faber, Georg Gottlob, Christoph Koch, Nicola Leone, Cristinel Mateis, Gerald Pfeifer & Francesco Scarcello (1997): The dlv System: Model Generator and Application Frontends. In: Proceedings of the 12th Workshop on Logic Programming 128137, pp. 128–137. Available at https://www.wfaber.com/research/papers/wlp97.pdf.
  4. Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2014): Clingo = ASP + Control: Preliminary Report. In: Technical Communications of the 13th International Conference on Logic Programming 14(4-5). Available at https://arxiv.org/abs/1405.3694.
  5. Martin Gebser, Benjamin Kaufmann, André Neumann & Torsten Schaub (2007): clasp : A Conflict-Driven Answer Set Solver. In: Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning 4483. Springer, Tempe, Arizona, pp. 260–265, doi:10.1007/978-3-540-72200-7_23.
  6. Martin Gebser, Philipp Obermeier, Thomas Otto, Schaub Torsten, Orkunt Sabuncu, Van Nguyen & Tran Cao Son (2018): Experimenting with robotic intra-logistics domains. Theory and Practice of Logic Programming 18(3-4), pp. 502–519, doi:10.1017/S1471068418000200.
  7. Michael Gelfond & Vladimir Lifschitz (1990): Logic Programs with Classical Negation. In: Logic Programming, Proceedings of the Seventh International Conference. MIT Press, Jerusalem, Israel, pp. 579–597. Available at https://dl.acm.org/doi/10.5555/87961.88030.
  8. Victor W. Marek & Miroslaw Truszczynski (1999): Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm - A 25-Year Perspective. Springer, pp. 375–398, doi:10.1007/978-3-642-60085-2_17.
  9. Ilkka Niemelä (1999): Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence 25(3-4), pp. 241–273, doi:10.1023/A:1018930122475.
  10. Poom Pianpak, Tran Cao Son, Z O Toups & William Yeoh (2019): A Distributed Solver for Multi-Agent Path Finding Problems. In: Proceedings of the First International Conference on Distributed Artificial Intelligence, pp. 1–7, doi:10.1145/3356464.3357702.
  11. Morgan Quigley, Ken Conley, Brian Gerkey, Josh Faust, Tully Foote, Jeremy Leibs, Rob Wheeler & Andrew Y. Ng (2009): ROS: an open-source Robot Operating System. In: ICRA workshop on open source software 3, Kobe, Japan, pp. 5. Available at http://www.cim.mcgill.ca/~dudek/417/Papers/quigley-icra2009-ros.pdf.
  12. Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant (2015): Conflict-based search for optimal multi-agent pathfinding. Artificial Intelligence 219, pp. 40–66, doi:10.1016/j.artint.2014.11.006.
  13. David Silver (2005): Cooperative Pathfinding. In: Proceedings of the 1st Artificial Intelligence and Interactive Digital Entertainment Conference 1. Marina Del Rey, pp. 117–122. Available at https://www.aaai.org/Library/AIIDE/2005/aiide05-020.php.

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