Producción CyT

Computational Models of Argument. Proceedings of COMMA 2012 - Argumentation games for admissibility and cogency criteria

Congreso

Autoría:

BODANZA, GUSTAVO ADRIAN ; Tohmé, Fernando Abel ; Simari, Guillermo R.

Fecha:

2012

Editorial y Lugar de Edición:

IOS Press

ISSN:

978-1-61499-110-6

Resumen *

In this work, we develop a game-theoretic framework in which pro and con arguments are put forward. The defined framework intends to capture win- ning strategies for different defense criteria; each possible extension semantics sat- isfies a particular defense criterion. To ensure that only semantics satisfying given criteria are obtained protocols for playing have to be defined, being the ensuing winning strategies full characterizations of the corresponding criteria. Admissibil- ity and strong admissibility are two of those criteria proposed in the literature for the evaluation of extension semantics; here, we also introduce two weaker criteria, pairwise and weak cogency, for the evaluation of non-admissible semantics, and we define specific game protocols to capture them. Información suministrada por el agente en SIGEVA

Palabras Clave

Extension SemanticsDefense CriteriaArgumentation GamesArgumentation Frameworks