A distributed self-stabilizing algorithm for argumentation

We propose a distributed approach to argumentation in which arguments are constructed by asynchronous processes which compute their own defeat status on the basis of local information. We present a self-stabilizing algorithm for the computation of defeat status, along with a proof of its correctness. The proposed approach introduces a remarkable flexibility in the management of argumentation activity with respect to a centralized approach. Moreover it is in line with the evolution of autonomous agents architectures, one of the main application fields of argumentation systems