Using Rewriting Rules to Compute Successful Modifications of an Argumentation System

Dionysios Kontarinis (1) , Alan Perotti (2) , Elise Bonzon (1) , Nicolas Maudet (3) , Leendert van Der Torre (4) , Serena Villata (5)

1 LIPADE - EA 2517 - Laboratoire d'Informatique Paris Descartes
2 UNITO - Università degli studi di Torino = University of Turin
3 SMA - Systèmes Multi-Agents
4 ICR - Individual and Collective Reasoning
5 WIMMICS - Web-Instrumented Man-Machine Interactions, Communities and Semantics

In this article, we define a procedure which computes the minimal change of an argumentation system that achieves some goal. We first study the properties of such minimal changes. Then we present a procedure based on a set of rewriting rules, and we analyse its properties.

Mots clés: Argumentation

Domaines: Intelligence artificielle [cs.AI]

Dionysios Kontarinis, Alan Perotti, Elise Bonzon, Nicolas Maudet, Leendert van Der Torre, et al.. Using Rewriting Rules to Compute Successful Modifications of an Argumentation System. Septièmes Journées d'Intelligence Artificielle Fondamentale, Jun 2013, Aix-en-Provence, France. pp.180-189. ⟨hal-00956607⟩