A self-correcting iteration schema for argumentation networks

D. M. Gabbay; O. Rodrigues

doi:10.3233/978-1-61499-436-7-377

A self-correcting iteration schema for argumentation networks

D. M. Gabbay, O. Rodrigues

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Given an argumentation network with initial values to the arguments, we look for a numerical algorithm yielding extensions compatible with such initial values. We offer an iteration schema that takes the initial values of the nodes and follows the attack relation producing a sequence of intermediate values that eventually becomes stable leading to an extension in the limit. The schema can be used in abstract as well as in abstract dialectical frameworks (ADFs).

Original language	English
Title of host publication	Computational Models of Argument - Proceedings of COMMA 2014
Editors	Simon Parsons, Nir Oren, Chris Reed, Federico Cerutti
Publisher	IOS Press BV
Pages	377-384
Number of pages	8
ISBN (Electronic)	9781614994350
DOIs	https://doi.org/10.3233/978-1-61499-436-7-377
State	Published - 2014
Event	5th International Conference on Computational Models of Argument, COMMA 2014 - Pitlochry, United Kingdom Duration: 9 Sep 2014 → 12 Sep 2014

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Volume	266
ISSN (Print)	0922-6389
ISSN (Electronic)	1879-8314

Conference

Conference	5th International Conference on Computational Models of Argument, COMMA 2014
Country/Territory	United Kingdom
City	Pitlochry
Period	9/09/14 → 12/09/14

Bibliographical note

Publisher Copyright:
© 2014 The authors and IOS PressAll rights reserved.

Keywords

Argumentation
equational approaches
numerical analysis

Access to Document

10.3233/978-1-61499-436-7-377

Cite this

@inproceedings{c944a9844031484d9cab078e1fe03f02,

title = "A self-correcting iteration schema for argumentation networks",

abstract = "Given an argumentation network with initial values to the arguments, we look for a numerical algorithm yielding extensions compatible with such initial values. We offer an iteration schema that takes the initial values of the nodes and follows the attack relation producing a sequence of intermediate values that eventually becomes stable leading to an extension in the limit. The schema can be used in abstract as well as in abstract dialectical frameworks (ADFs).",

keywords = "Argumentation, equational approaches, numerical analysis",

author = "Gabbay, {D. M.} and O. Rodrigues",

note = "Publisher Copyright: {\textcopyright} 2014 The authors and IOS PressAll rights reserved.; 5th International Conference on Computational Models of Argument, COMMA 2014 ; Conference date: 09-09-2014 Through 12-09-2014",

year = "2014",

doi = "10.3233/978-1-61499-436-7-377",

language = "אנגלית",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press BV",

pages = "377--384",

editor = "Simon Parsons and Nir Oren and Chris Reed and Federico Cerutti",

booktitle = "Computational Models of Argument - Proceedings of COMMA 2014",

address = "הולנד",

}

Gabbay, DM & Rodrigues, O 2014, A self-correcting iteration schema for argumentation networks. in S Parsons, N Oren, C Reed & F Cerutti (eds), Computational Models of Argument - Proceedings of COMMA 2014. Frontiers in Artificial Intelligence and Applications, vol. 266, IOS Press BV, pp. 377-384, 5th International Conference on Computational Models of Argument, COMMA 2014, Pitlochry, United Kingdom, 9/09/14. https://doi.org/10.3233/978-1-61499-436-7-377

A self-correcting iteration schema for argumentation networks. / Gabbay, D. M.; Rodrigues, O.
Computational Models of Argument - Proceedings of COMMA 2014. ed. / Simon Parsons; Nir Oren; Chris Reed; Federico Cerutti. IOS Press BV, 2014. p. 377-384 (Frontiers in Artificial Intelligence and Applications; Vol. 266).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A self-correcting iteration schema for argumentation networks

AU - Gabbay, D. M.

AU - Rodrigues, O.

PY - 2014

Y1 - 2014

N2 - Given an argumentation network with initial values to the arguments, we look for a numerical algorithm yielding extensions compatible with such initial values. We offer an iteration schema that takes the initial values of the nodes and follows the attack relation producing a sequence of intermediate values that eventually becomes stable leading to an extension in the limit. The schema can be used in abstract as well as in abstract dialectical frameworks (ADFs).

AB - Given an argumentation network with initial values to the arguments, we look for a numerical algorithm yielding extensions compatible with such initial values. We offer an iteration schema that takes the initial values of the nodes and follows the attack relation producing a sequence of intermediate values that eventually becomes stable leading to an extension in the limit. The schema can be used in abstract as well as in abstract dialectical frameworks (ADFs).

KW - Argumentation

KW - equational approaches

KW - numerical analysis

UR - http://www.scopus.com/inward/record.url?scp=84940556985&partnerID=8YFLogxK

U2 - 10.3233/978-1-61499-436-7-377

DO - 10.3233/978-1-61499-436-7-377

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84940556985

T3 - Frontiers in Artificial Intelligence and Applications

SP - 377

EP - 384

BT - Computational Models of Argument - Proceedings of COMMA 2014

A2 - Parsons, Simon

A2 - Oren, Nir

A2 - Reed, Chris

A2 - Cerutti, Federico

PB - IOS Press BV

T2 - 5th International Conference on Computational Models of Argument, COMMA 2014

Y2 - 9 September 2014 through 12 September 2014

ER -

A self-correcting iteration schema for argumentation networks

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this