Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming

Studia Logica 93 (2/3):383 - 403 (2009)
Abstract
In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming
Keywords abstract argumentation  complete extensions  logic programming
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,404
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Citations of this work BETA
Dov M. Gabbay (2009). Fibring Argumentation Frames. Studia Logica 93 (2/3):231 - 295.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-11-21

Total downloads

6 ( #207,289 of 1,103,009 )

Recent downloads (6 months)

2 ( #183,252 of 1,103,009 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.