Conditional Acceptance Functions - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2012

Conditional Acceptance Functions


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.
Fichier principal
Vignette du fichier
comma2012_conditionalacceptance.pdf (132.14 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00762955 , version 1 (16-06-2016)



Richard Booth, Souhila Kaci, Tjitze Rienstra, Leendert van Der Torre. Conditional Acceptance Functions. COMMA: Computational Models of Argument, Sep 2012, Vienna, Austria. pp.470-477, ⟨10.3233/978-1-61499-111-3-470⟩. ⟨lirmm-00762955⟩
251 View
248 Download



Gmail Mastodon Facebook X LinkedIn More