Skip to Main content Skip to Navigation
Conference papers

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.
keyword : Argumentation
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00956607
Contributor : Dionysios Kontarinis <>
Submitted on : Friday, March 7, 2014 - 2:29:16 AM
Last modification on : Tuesday, May 26, 2020 - 6:50:41 PM

Identifiers

  • HAL Id : hal-00956607, version 1

Citation

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⟩

Share

Metrics

Record views

461