A self-correcting iteration schema for argumentation networks

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

1 Citation (Scopus)
2 Downloads (Pure)


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 languageEnglish
Title of host publicationComputational Models of Argument
EditorsSimon Parsons, Nir Oren, Chris Reed, Federico Cerutti
PublisherIOS Press
Number of pages48
ISBN (Electronic)978-1-61499-436-7
ISBN (Print)978-1-61499-435-0
Publication statusPublished - 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press


Dive into the research topics of 'A self-correcting iteration schema for argumentation networks'. Together they form a unique fingerprint.

Cite this