Justifying answer sets using argumentation. Issue 1 (11th February 2015)

• Record Type: Journal Article
• Authors: SCHULZ, CLAUDIA; TONI, FRANCESCA
• Is Part Of: Theory and practice of logic programming. Volume 16:Issue 1(2016)
• Page Start: 59
• Page End: 110
• Publication Date: 2015-02-11
• Subjects: answer set programming, -- assumption-based argumentation, -- stable extension, -- explanation; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068414000702
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: An answer set is a plain set of literals which has no further structure that would explain why certain literals are part of it and why others are not. We show how argumentation theory can help to explain why a literal is or is not contained in a given answer set by defining two justification methods, both of which make use of the correspondence between answer sets of a logic program and stable extensions of the assumption-based argumentation (ABA) framework constructed from the same logic program. Attack Trees justify a literal in argumentation-theoretic terms, i.e. using arguments and attacks between them, whereas ABA-Based Answer Set Justifications express the same justification structure in logic programming terms, that is using literals and their relationships. Interestingly, an ABA-Based Answer Set Justification corresponds to an admissible fragment of the answer set in question, and an Attack Tree corresponds to an admissible fragment of the stable extension corresponding to this answer set.