Rewriting Rules for the Computation of Goal-Oriented Changes in an Argumentation System

When several agents are engaged in an argumentation process, they are faced with the problem of deciding how to contribute to the current state of the debate in order to satisfy their own goal, ie. to make an argument under a given semantics accepted or not. In this paper, we study the minimal changes (or target sets) on the current state of the debate that are required to achieve such a goal, where changes are the addition and/or deletion of attacks among arguments. We study some properties of these target sets, and propose a Maude specification of rewriting rules which allow to compute all the target sets for some types of goal