On the Equivalence between Assumption-Based Argumentation and Logic Programming
Open Access
- 14 December 2017
- journal article
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 60, 779-825
Abstract
Assumption-Based Argumentation (ABA) has been shown to subsume various other non-monotonic reasoning formalisms, among them normal logic programming (LP). We re-examine the relationship between ABA and LP and show that normal LP also subsumes (flat) ABA. More precisely, we specify a procedure that given a (flat) ABA framework yields an associated logic program with almost the same syntax whose semantics coincide with those of the ABA framework. That is, the 3-valued stable (respectively well-founded, regular, 2-valued stable, and ideal) models of the associated logic program coincide with the complete (respectively grounded, preferred, stable, and ideal) assumption labellings and extensions of the ABA framework. Moreover, we show how our results on the translation from ABA to LP can be reapplied for a reverse translation from LP to ABA, and observe that some of the existing results in the literature are in fact special cases of our work. Overall, we show that (flat) ABA frameworks can be seen as normal logic programs with a slightly different syntax. This implies that methods developed for one of these formalisms can be equivalently applied to the other by simply modifying the syntax.Keywords
This publication has 37 references indexed in Scilit:
- Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic ProgrammingStudia Logica, 2009
- Modular argumentation for modelling legal doctrines in common law of contractArtificial Intelligence and Law, 2009
- Assumption-Based Argumentation for Closed and Consistent Defeasible Reasoning2008
- Computing ideal sceptical argumentationArtificial Intelligence, 2007
- Dialectic proof procedures for assumption-based, admissible argumentationArtificial Intelligence, 2006
- ASSAT: computing answer sets of a logic program by SAT solversArtificial Intelligence, 2004
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995
- On the equivalence of semantics for normal logic programsThe Journal of Logic Programming, 1995
- An argumentation-theoretic foundation for logic programmingThe Journal of Logic Programming, 1995
- Results on translating defaults to circumscriptionArtificial Intelligence, 1987