A Logical Account of Formal Argumentation

Studia Logica 93 (2-3):383-403 (2009)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,205

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

多エージェント系自己認識論理の論理プログラムへの変換.外山 勝彦 小島 隆弘 - 2002 - Transactions of the Japanese Society for Artificial Intelligence 17:114-126.

Analytics

Added to PP
2009-11-21

Downloads
50 (#349,471)

6 months
13 (#209,859)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dov Gabbay
Hebrew University of Jerusalem