[en] Recently, two operators - the down-admissible and up-complete operators - have been proposed, in the context of aggregating argument labellings, for repairing a given initial labelling so that it becomes rational, in the sense that it respects the attack relation between the arguments. The purpose of this research note is to give some initial thoughts on defining dialogue games for each of them, as well as for their combination.
Research center :
SnT
Disciplines :
Computer science
Author, co-author :
Caminada, Martin; University of Aberdeen
Booth, Richard ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Language :
English
Title :
Towards Dialogue Games for the Down-Admissible and Up-Complete Procedures
Publication date :
29 April 2014
Version :
1.0
Number of pages :
11
Name of the research project :
R-AGR-0448-1 > CORE 2012/CS12/IS/3983238: DYNGBaT - Dynamics of Group Belie > 01/03/2013 - > VAN DER TORRE Léon
