Complete extensions in argumentation coincide with 3-valued stable models in logic programming

Yining Wu; Martin Caminada; Dov M. Gabbay

doi:10.1007/s11225-009-9210-5

Complete extensions in argumentation coincide with 3-valued stable models in logic programming

Yining Wu
, Martin Caminada
, Dov M. Gabbay

Department of Computer Science and Artificial Intelligence

University of Luxembourg
King's College London

Research output: Contribution to journal › Article › peer-review

75 Scopus citations

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.

Original language	English
Pages (from-to)	383-403
Number of pages	21
Journal	Studia Logica
Volume	93
Issue number	2
DOIs	https://doi.org/10.1007/s11225-009-9210-5
State	Published - Dec 2009

Keywords

3-valued stable models
Abstract argumentation
Complete extensions
Logic programming

Access to Document

10.1007/s11225-009-9210-5

Cite this

@article{2de43e176324472f861f9963a147eda9,

title = "Complete extensions in argumentation coincide with 3-valued stable models in logic programming",

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 = "3-valued stable models, Abstract argumentation, Complete extensions, Logic programming",

author = "Yining Wu and Martin Caminada and Gabbay, \{Dov M.\}",

year = "2009",

month = dec,

doi = "10.1007/s11225-009-9210-5",

language = "אנגלית",

volume = "93",

pages = "383--403",

journal = "Studia Logica",

issn = "0039-3215",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - Complete extensions in argumentation coincide with 3-valued stable models in logic programming

AU - Wu, Yining

AU - Caminada, Martin

AU - Gabbay, Dov M.

PY - 2009/12

Y1 - 2009/12

N2 - 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.

AB - 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.

KW - 3-valued stable models

KW - Abstract argumentation

KW - Complete extensions

KW - Logic programming

UR - https://www.scopus.com/pages/publications/71149107231

U2 - 10.1007/s11225-009-9210-5

DO - 10.1007/s11225-009-9210-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:71149107231

SN - 0039-3215

VL - 93

SP - 383

EP - 403

JO - Studia Logica

JF - Studia Logica

IS - 2

ER -

Complete extensions in argumentation coincide with 3-valued stable models in logic programming

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this