References

  1. Christian Anger, Kathrin Konczak & Thomas Linke (2001): NoMoRe: A System for Non-Monotonie Reasoning under Answer Set Semantics. PSC 802 BOX 14 FPO 09499-0014, pp. 406, doi:10.1007/3-540-45744-5_24.
  2. Chitta Baral (2010): Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press. Available at http://www.cambridge.org/de/academic/subjects/computer-science/artificial-intelligence-and-natural-language-processing/knowledge-representation-reasoning-and-declarative-problem-solving.
  3. Thomas Eiter, Wolfgang Faber, Nicola Leone & Gerald Pfeifer (2000): Declarative problem-solving using the DLV system. In: Logic-based artificial intelligence. Springer, pp. 79–103, doi:10.1016/S0743-1066(96)00125-2.
  4. Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2014): Clingo = ASP + Control: Preliminary Report. CoRR abs/1405.3694.
  5. Martin Gebser, Benjamin Kaufmann, André Neumann & Torsten Schaub (2007): Conflict-driven answer set solving. In: IJCAI 7, pp. 386–392. Available at http://ijcai.org/Proceedings/07/Papers/060.pdf.
  6. Michael Gelfond & Yulia Kahl (2014): Knowledge representation, reasoning, and the design of intelligent agents: The answer-set programming approach. Cambridge University Press, doi:10.1017/CBO9781139342124.
  7. Michael Gelfond & Vladimir Lifschitz (1988): The Stable Model Semantics for Logic Programming. In: Robert A. Kowalski & Kenneth A. Bowen: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes). MIT Press, pp. 1070–1080.
  8. Aric A. Hagberg, Daniel A. Schult & Pieter J. Swart (2008): Exploring Network Structure, Dynamics, and Function using NetworkX. In: Gaël Varoquaux, Travis Vaught & Jarrod Millman: Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp. 11 – 15. Available at http://conference.scipy.org/proceedings/SciPy2008/paper_2/.
  9. Kathrin Konczak, Thomas Linke & Torsten Schaub (2006): Graphs and colorings for answer set programming. Theory Pract. Log. Program. 6(1-2), pp. 61–106, doi:10.1017/S1471068405002528.
  10. Fang Li, Huaduo Wang & Gopal Gupta (2021): grASP: A Graph Based ASP-Solver and Justification System. CoRR abs/2104.01190. Available at https://arxiv.org/abs/2104.01190.
  11. Vladimir Lifschitz & Hudson Turner (1994): Splitting a Logic Program. In: Pascal Van Hentenryck: Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Marherita Ligure, Italy, June 13-18, 1994. MIT Press, pp. 23–37.
  12. Thomas Linke & Vladimir Sarsakov (2005): Suitable graphs for answer set programming. In: International Conference on Logic for Programming Artificial Intelligence and Reasoning. Springer, pp. 154–168, doi:10.1007/978-3-540-24609-1_26.
  13. Victor W Marek & Miroslaw Truszczyński (1999): Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm. Springer, pp. 375–398, doi:10.1006/jcss.1995.1053.
  14. Kyle Marple, Ajay Bansal, Richard Min & Gopal Gupta (2012): Goal-directed execution of answer set programs. In: Proc. PPDP'12. ACM, pp. 35–44, doi:10.1145/2370776.2370782.
  15. João P. Marques Silva & Karem A. Sakallah (1996): GRASP - a new search algorithm for satisfiability. In: Rob A. Rutenbar & Ralph H. J. M. Otten: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996. IEEE Computer Society / ACM, pp. 220–227, doi:10.1109/ICCAD.1996.569607.

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