Using Rewriting Rules to Compute Successful Modifications of an Argumentation System

Dionysios Kontarinis; Alan Perotti; Elise Bonzon; Nicolas Maudet; Leendert Van Der Torre; Serena Villata

Using Rewriting Rules to Compute Successful Modifications of an Argumentation System

Dionysios Kontarinis ¹ Alan Perotti ² Elise Bonzon ¹ Nicolas Maudet ³ Leendert Van Der Torre ⁴ Serena Villata ⁵

1 LIPADE - EA 2517 - Laboratoire d'Informatique Paris Descartes

2 UNITO - Università degli studi di Torino

3 SMA - Systèmes Multi-Agents

LIP6 - Laboratoire d'Informatique de Paris 6

4 ICR - Individual and Collective Reasoning

5 WIMMICS - Web-Instrumented Man-Machine Interactions, Communities and Semantics

CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - SPARKS - Scalable and Pervasive softwARe and Knowledge Systems

Abstract : 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.

keyword : Argumentation

Type de document :

Communication dans un congrès

Septièmes Journées d'Intelligence Artificielle Fondamentale, Jun 2013, Aix-en-Provence, France. pp.180-189, 2013

Domaine :

Informatique [cs] / Intelligence artificielle [cs.AI]

Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00956607
Contributeur : Dionysios Kontarinis <>
Soumis le : vendredi 7 mars 2014 - 02:29:16
Dernière modification le : jeudi 21 mars 2019 - 14:30:29

Using Rewriting Rules to Compute Successful Modifications of an Argumentation System

Identifiants

Collections

Citation

Exporter

Métriques

422

Contact

Using Rewriting Rules to Compute Successful Modifications of an Argumentation System

Identifiants

Collections

Citation

Exporter

Partager

Métriques

422

Contact