[en] Dung-style abstract argumentation theory centers on argumentation frameworks and acceptance functions. The latter take as input a framework and return sets of labelings. This methodology assumes full awareness of the arguments relevant to the evaluation. There are two reasons why this is not satisfactory. Firstly, full awareness is, in general, not a realistic assumption. Second, frameworks have explanatory power, which allows us to reason abductively or counterfactually, but this is lost under the usual semantics. To recover this aspect, we generalize conventional acceptance, and we present the concept of a conditional acceptance function.
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-CONFERENCE-2012-412
Auteur, co-auteur :
BOOTH, Richard ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Kaci, Souhila
RIENSTRA, Tjitze ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
VAN DER TORRE, Leon ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Conditional acceptance functions
Date de publication/diffusion :
2012
Nom de la manifestation :
4th International Conference on Computational Models of Argument (COMMA 2012)
Lieu de la manifestation :
Vienna, Autriche
Date de la manifestation :
September 2012
Manifestation à portée :
International
Titre de l'ouvrage principal :
4th International Conference on Computational Models of Argument (COMMA 2012)