A Probabilistic Semantics for Abstract Argumentation

被引:107
作者
Thimm, Matthias [1 ]
机构
[1] Univ Koblenz Landau, Inst Web Sci & Technol, Landau, Germany
来源
20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012) | 2012年 / 242卷
关键词
LOGIC;
D O I
10.3233/978-1-61499-098-7-750
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Classical semantics for abstract argumentation frameworks are usually defined in terms of extensions or, more recently, labelings. That is, an argument is either regarded as accepted with respect to a labeling or not. In order to reason with a specific semantics one takes either a credulous or skeptical approach, i.e. an argument is ultimately accepted, if it is accepted in one or all labelings, respectively. In this paper, we propose a more general approach for a semantics that allows for a more fine-grained differentiation between those two extreme views on reasoning. In particular, we propose a probabilistic semantics for abstract argumentation that assigns probabilities or degrees of belief to individual arguments. We show that our semantics generalizes the classical notions of semantics and we point out interesting relationships between concepts from argumentation and probabilistic reasoning. We illustrate the usefulness of our semantics on an example from the medical domain.
引用
收藏
页码:750 / 755
页数:6
相关论文
共 50 条
[31]   Approximating problems in abstract argumentation with graph convolutional networks [J].
Malmqvist, Lars ;
Yuan, Tangming ;
Nightingale, Peter .
ARTIFICIAL INTELLIGENCE, 2024, 336
[32]   CONCILIATORY REASONING, SELF-DEFEAT, AND ABSTRACT ARGUMENTATION [J].
Knoks, Aleks .
REVIEW OF SYMBOLIC LOGIC, 2023, 16 (03) :740-787
[33]   AGM Meets Abstract Argumentation: Contraction for Dung Frameworks [J].
Baumann, Ringo ;
Linker, Felix .
LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 :41-57
[34]   On support relations in abstract argumentation as abstractions of inferential relations [J].
Prakken, Henry .
21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 :735-740
[35]   On efficiently estimating the probability of extensions in abstract argumentation frameworks [J].
Fazzinga, Bettina ;
Flesca, Sergio ;
Parisi, Francesco .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 69 :106-132
[36]   A distribution semantics for probabilistic term rewriting [J].
Vidal, German .
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2025, 146
[37]   Approximating operators and semantics for abstract dialectical frameworks [J].
Strass, Hannes .
ARTIFICIAL INTELLIGENCE, 2013, 205 :39-70
[38]   Semantics of Opinion Transitions in Multi-Agent Forum Argumentation [J].
Arisaka, Ryuta ;
Ito, Takayuki .
PRICAI 2019: TRENDS IN ARTIFICIAL INTELLIGENCE, PT I, 2019, 11670 :688-703
[39]   A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics [J].
Alsinet, Teresa ;
Bejar, Ramon ;
Godo, Lluis .
ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2010, 2010, 6433 :40-49
[40]   A Generalization of Probabilistic Argumentation with Dempster-Shafer Theory [J].
Nguyen Duy Hung .
KI 2017: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2017, 10505 :155-169