Graduate studies at Western
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  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)|
|Through your library||Configure|
Similar books and articles
Martin Caminada (2011). A Labelling Approach for Ideal and Stage Semantics. Argument and Computation 2 (1):1 - 21.
Robert A. Kowalski & Francesca Toni (1996). Abstract Argumentation. Artificial Intelligence and Law 4 (3-4):275-296.
Masanori Itai (1991). On the Strong Martin Conjecture. Journal of Symbolic Logic 56 (3):862-875.
Helena Rasiowa (1979). Algorithmic Logic. Multiple-Valued Extensions. Studia Logica 38 (4):317 - 335.
Martin W. A. Caminada & Dov M. Gabbay (2009). A Logical Account of Formal Argumentation. Studia Logica 93 (2/3):109 - 145.
Added to index2009-11-21
Total downloads4 ( #189,403 of 739,388 )
Recent downloads (6 months)0
How can I increase my downloads?