Towards Dialogue Games for the Down-Admissible and Up-Complete Procedures (bibtex)
by M. Caminada, R. Booth
Abstract:
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.
Reference:
Towards Dialogue Games for the Down-Admissible and Up-Complete Procedures (M. Caminada, R. Booth), 2014.
Bibtex Entry:
@Other{10993/16504,
  Title                    = {Towards Dialogue Games for the Down-Admissible and Up-Complete Procedures},
  Abstract                 = {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.},
  Author                   = {Caminada, M. and Booth, R.},
  Organization             = {Fonds National de la Recherche - FnR},
  Timestamp                = {2015.01.26},
  Year                     = {2014}
}
Powered by bibtexbrowser