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 条
[41]   A Generalization of Probabilistic Argumentation with Dempster-Shafer Theory [J].
Nguyen Duy Hung .
KI 2017: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2017, 10505 :155-169
[42]   Probabilistic Assumption-based Argumentation with DST evidence [J].
Hung, Nguyen Duy .
2017 JOINT 17TH WORLD CONGRESS OF INTERNATIONAL FUZZY SYSTEMS ASSOCIATION AND 9TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND INTELLIGENT SYSTEMS (IFSA-SCIS), 2017,
[43]   A quantitative approach to belief revision in structured probabilistic argumentation [J].
Simari, Gerardo I. ;
Shakarian, Paulo ;
Falappa, Marcelo A. .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2016, 76 (3-4) :375-408
[44]   Towards fixed-parameter tractable algorithms for abstract argumentation [J].
Dvorak, Wolfgang ;
Pichler, Reinhard ;
Woltran, Stefan .
ARTIFICIAL INTELLIGENCE, 2012, 186 :1-37
[45]   An extension-based approach to belief revision in abstract argumentation [J].
Diller, Martin ;
Haret, Adrian ;
Linsbichler, Thomas ;
Ruemmele, Stefan ;
Woltran, Stefan .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 93 :395-423
[46]   AGM Meets Abstract Argumentation: Expansion and Revision for Dung Frameworks [J].
Baumann, Ringo ;
Brewka, Gerhard .
PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, :2734-2740
[47]   Modeling Human Decision Making with an Abstract Dynamic Argumentation Framework [J].
Sapino, Maximiliano ;
Ferretti, Edgardo ;
Marinelarena Dondena, Luciana ;
Errecalde, Marcelo .
COMPUTER SCIENCE - CACIC 2020, 2021, 1409 :3-18
[48]   Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments [J].
Flouris, Giorgos ;
Patkos, Theodore ;
Bikakis, Antonis ;
Vassiliades, Alexandros ;
Bassiliades, Nick ;
Plexousakis, Dimitris .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2023, 161
[49]   An Extension-Based Approach to Belief Revision in Abstract Argumentation [J].
Diller, Martin ;
Haret, Adrian ;
Linsbichler, Thomas ;
Ruemmele, Stefan ;
Woltran, Stefan .
PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, :2926-2932
[50]   An Acceptance Semantics for Stable Modal Knowledge Extended Abstract [J].
Hawke, Peter .
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, (379) :331-343