Published September 10, 2012
| Version v1
Conference paper
Conditional Acceptance Functions
Contributors
Others:
- Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT) ; Université du Luxembourg = University of Luxembourg = Universität Luxemburg (uni.lu)
- Faculty of Science, Technology and Communication [Luxembourg] (FSTC) ; Université du Luxembourg = University of Luxembourg = Universität Luxemburg (uni.lu)
- Graphs for Inferences on Knowledge (GRAPHIK) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- Individual and Collective Reasoning (ICR) ; Université du Luxembourg = University of Luxembourg = Universität Luxemburg (uni.lu)
- IOS Press
Description
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.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://hal-lirmm.ccsd.cnrs.fr/lirmm-00762955
- URN
- urn:oai:HAL:lirmm-00762955v1
Origin repository
- Origin repository
- UNICA