References

  1. Joaquín Arias, Manuel Carro, Elmer Salazar, Kyle Marple & Gopal Gupta (2018): Constraint Answer Set Programming without Grounding. Theory and Practice of Logic Programming 18(3-4), pp. 337–354, doi:10.1017/S1471068418000285. Available at https://arxiv.org/abs/1804.11162.
  2. Pedro Cabalar, Jorge Fandinno & Michael Fink (2014): Causal Graph Justifications of Logic Programs. Theory and Practice of Logic Programming 14(4-5), pp. 603–618, doi:10.1017/S1471068414000234.
  3. Pedro Cabalar, Jorge Fandinno & Brais Muñiz (2020): A System for Explainable Answer Set Programming. In: Pedro Cabalar, Andreas Herzig, David Pearce, Torsten Schaub & Stefan Woltran: Declarative Problem Solving (ECAI 2020 Workshop).
  4. Zhuo Chen, Kyle Marple, Elmer Salazar, Gopal Gupta & Lakshman Tamil (2016): A Physician Advisory System for Chronic Heart Failure Management Based on Knowledge Patterns. Theory and Practice of Logic Programming 16(5-6), pp. 604–618, doi:10.1017/S1471068416000429.
  5. Keith L. Clark (1978): Negation as Failure. In: H. Gallaire & J. Minker: Logic and Data Bases. Springer, pp. 293–322, doi:10.1007/978-1-4684-3384-5_11.
  6. DARPA (2017): Explainable Artificial Intelligence (XAI). Defense Advanced Research Projects Agency. https://www.darpa.mil/program/explainable-artificial-intelligence.
  7. European Union (2016): General Data Protection Regulation (GDPR). Regulation (EU) 2016/679 of the European Parliament and of the Council. https://eur-lex.europa.eu/eli/reg/2016/679/oj.
  8. Jorge Fandinno & Claudia Schulz (2019): Answering the "Why" in Answer Set Programming - A Survey of Explanation Approaches. Theory and Practice of Logic Programming 19(2), pp. 114–203, doi:10.1017/S1471068418000534.
  9. Alejandro Javier García, Carlos Iván Chesñevar, Nicolás D. Rotstein & Guillermo Ricardo Simari (2013): Formalizing Dialectical Explanation Support for Argument-Based Reasoning in Knowledge-Based Systems. Expert Systems and Applications 40(8), pp. 3233–3247, doi:10.1016/j.eswa.2012.12.036.
  10. Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2014): Clingo = ASP + Control: Preliminary Report. arXiv 1405.3694. Available at https://arxiv.org/abs/1405.3694.
  11. A. Van Gelder, K. Ross & J. Schlipf (1991): The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38, pp. 620–650, doi:10.1145/116825.116838.
  12. Michael Gelfond & Vladimir Lifschitz (1988): The Stable Model Semantics for Logic Programming. In: 5th International Conference on Logic Programming, pp. 1070–1080. Available at http://www.cse.unsw.edu.au/~cs4415/2010/resources/stable.pdf.
  13. M. V. Hermenegildo, F. Bueno, M. Carro, P. Lopez-Garcia, E. Mera, J.F. Morales & G. Puebla (2012): An Overview of Ciao and its Design Philosophy. Theory and Practice of Logic Programming 12(1–2), pp. 219–252, doi:10.1017/S1471068411000457. Available at http://arxiv.org/abs/1102.5497.
  14. Kyle Marple, Elmer Salazar & Gopal Gupta (2017): Computing Stable Models of Normal Logic Programs Without Grounding. arXiv 1709.00501. Available at http://arxiv.org/abs/1709.00501.
  15. Luís Moniz Pereira & Joaquim Nunes Aparício (1989): Relevant Counterfactuals. In: EPIA 89, 4th Portuguese Conference on Artificial Intelligence, Lisbon, Portugal, September 26-29, 1989, Proceedings, pp. 107–118, doi:10.1007/3-540-51665-4_78.
  16. Enrico Pontelli, Tran Cao Son & Omar El-Khatib (2009): Justifications for Logic Programs under Answer Set Semantics. Theory and Practice of Logic Programming 9(1), pp. 1–56, doi:10.1017/S1471068408003633.
  17. Claudia Schulz & Francesca Toni (2016): Justifying Answer Sets Using Argumentation. Theory and Practice of Logic Programming 16(1), pp. 59–110, doi:10.1017/S1471068414000702.
  18. Farhad Shakerin & Gopal Gupta (2019): Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME. In: AAAI 2019, pp. 3052–3059, doi:10.1609/aaai.v33i01.33013052.
  19. Terrance Swift & David Scott Warren (2012): XSB: Extending Prolog with Tabled Logic Programming. Theory and Practice of Logic Programming 12(1-2), pp. 157–187, doi:10.1017/S1471068411000500.
  20. Sarat Chandra Varanasi, Elmer Salazar, Neeraj Mittal & Gopal Gupta (2019): Synthesizing Imperative Code from Answer Set Programming Specifications. In: LOPSTR, Lecture Notes in Computer Science 12042. Springer, pp. 75–89, doi:10.1007/978-3-030-45260-5_5.

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