Argumentation games for admissibility and cogency criteria

BODANZA, GUSTAVO ADRIÁN; TOHMÉ, FERNANDO ABEL; SIMARI, GUILLERMO R.

Viena

Congreso; Fourth International Conference on Computational Models of Argument; 2012

Institute of Artificial Intelligence, University of Groningen

 In this work, we develop a game-theoretic framework in which pro andcon 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 givencriteria are obtained protocols for playing have to be defined, being the ensuingwinning strategies full characterizations of the corresponding criteria. Admissibil-ity and strong admissibility are two of those criteria proposed in the literature forthe evaluation of extension semantics; here, we also introduce two weaker criteria,pairwise and weak cogency, for the evaluation of non-admissible semantics, andwe define specific game protocols to capture them.