Justifying answer sets using argumentation

From MaRDI portal
Publication:4593019

DOI10.1017/S1471068414000702zbMATH Open1379.68301arXiv1411.5635OpenAlexW3099229524WikidataQ62042299 ScholiaQ62042299MaRDI QIDQ4593019FDOQ4593019


Authors: Claudia Schulz, Francesca Toni Edit this on Wikidata


Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1411.5635




Recommendations




Cites Work


Cited In (20)

Uses Software





This page was built for publication: Justifying answer sets using argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593019)