Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Schulz, Claudia 2017. On the equivalence between assumption-based argumentation and logic programming. Journal of Artificial Intelligence Research 60 , pp. 779-825. 10.1613/jair.5581 |
Preview |
PDF (JAIR License V1.0 https://jair.org/index.php/jair/about#jair-license)
- Published Version
Download (505kB) | Preview |
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.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Publisher: | AI Access Foundation |
ISSN: | 1076-9757 |
Date of First Compliant Deposit: | 15 November 2017 |
Last Modified: | 03 May 2023 18:20 |
URI: | https://orca.cardiff.ac.uk/id/eprint/105833 |
Citation Data
Cited 20 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |