Answering the “why” in answer set programming – A survey of explanation approaches
- 15 January 2019
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 114-203
Abstract
Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanation” for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is answer set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question ofwhyan answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals isnotan answer set or why no solution exists at all.Keywords
This publication has 75 references indexed in Scilit:
- Justifications for logic programs under answer set semanticsTheory and Practice of Logic Programming, 2009
- The DLV system for knowledge representation and reasoningACM Transactions on Computational Logic, 2006
- On the existence of stable models of non-stratified logic programsTheory and Practice of Logic Programming, 2006
- Graphs and colorings for answer set programmingTheory and Practice of Logic Programming, 2006
- On the equivalence and range of applicability of graph-based representations of logic programsInformation Processing Letters, 2002
- Graph theoretical structures in logic programs and default theoriesTheoretical Computer Science, 1996
- A three-valued semantics for deductive databases and logic programsJournal of Computer and System Sciences, 1994
- Non-monotonic reasoning with logic programmingThe Journal of Logic Programming, 1993
- Debugging by diagnosing assumptions1993
- An explanation shell for expert systemsComputational Intelligence, 1986