Name
Title | ||
|---|---|---|
Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. |
Abstract | ||
|---|---|---|
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 [8] 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. We believe the results of this paper are not only relevant by themselves, but can also potentially be used for future work on the correspondence,between argumentation,and logic programming,semantics. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s11225-009-9210-5 | Studia Logica |
Keywords | Field | DocType |
abstract argumentation,complete extensions,logic programming,3-valued stable models | Functional logic programming,Computational logic,Discrete mathematics,Horn clause,Abstract model theory,Inductive programming,Algorithm,Prolog,Probabilistic argumentation,Logic programming,Mathematics | Journal |
Volume | Issue | ISSN |
93 | 2-3 | 1572-8730 |
Citations | PageRank | References |
30 | 1.16 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yining Wu | 1 | 30 | 2.17 |
| Martin W. A. Caminada | 2 | 865 | 46.84 |
| Dov M. Gabbay | 3 | 2639 | 355.03 |