Removed Set-Based Revision of Abstract Argumentation Frameworks

Argumentation frameworks have aroused intense interest from the AI community over the past years. Dynamic aspects of argumentation frameworks have received some interest from the community, but none of these works tries to address the recovering problem, that is, what shall we do when the new addition leads to the loss of all extensions. Such problem is typically a belief revision problem. In this paper, we propose a revision operator to revise an argumentation framework by another one, with the guarantee that the result of the operation will be an argumentation framework which has at least one stable extension. We also propose an algorithm to compute the revision operation outcome.