A self-correcting iteration schema for argumentation networks

Dov M. Gabbay, Odinaldo Rodrigues

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