Using Rewriting Rules to Compute Successful Modifications of an Argumentation System - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Using Rewriting Rules to Compute Successful Modifications of an Argumentation System

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.

Keywords

No file

Dates and versions

hal-00956607 , version 1 (07-03-2014)

Identifiers

  • HAL Id : hal-00956607 , version 1

Cite

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⟩
206 View
0 Download

Share

Gmail Facebook X LinkedIn More