Probabilities on Extensions in Abstract Argumentation

被引:5
|
作者
Thimm, Matthias [1 ]
Baroni, Pietro [2 ]
Giacomin, Massimiliano [2 ]
Vicig, Paolo [3 ]
机构
[1] Univ Koblenz Landau, Inst Web Sci & Technol WeST, Koblenz, Germany
[2] Univ Brescia, Dip Ingn Informaz, Brescia, Italy
[3] Univ Trieste, DEAMS, Trieste, Italy
关键词
EQUATIONAL APPROACH; SEMANTICS; SYSTEMS;
D O I
10.1007/978-3-319-75553-3_7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Combining computational models of argumentation with probability theory has recently gained increasing attention, in particular with respect to abstract argumentation frameworks. Approaches following this idea can be categorised into the constellations and the epistemic approach. While the former considers probability functions on the subgraphs of abstract argumentation frameworks, the latter uses probability theory to represent degrees of belief in arguments, given a fixed framework. In this paper, we investigate the case where probability functions are given on the extensions of abstract argumentation frameworks. This generalises classical semantics in a straightforward fashion and we show that our approach also complies with many postulates for epistemic probabilistic argumentation.
引用
收藏
页码:102 / 119
页数:18
相关论文
共 50 条
  • [1] Computing Extensions' Probabilities in Probabilistic Abstract Argumentation: Beyond Independence
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1588 - 1589
  • [2] Efficiently computing extensions' probabilities over probabilistic Bipolar Abstract Argumentation Frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    Scala, Francesco
    INTELLIGENZA ARTIFICIALE, 2019, 13 (02) : 189 - 200
  • [3] Ranking Extensions in Abstract Argumentation
    Skiba, Kenneth
    Rienstra, Tjitze
    Thimm, Matthias
    Heyninck, Jesse
    Kern-Isberner, Gabriele
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 2047 - 2053
  • [4] On Rationality Conditions for Epistemic Probabilities in Abstract Argumentation
    Baroni, Pietro
    Giacomin, Massimiliano
    Vicig, Paolo
    COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 121 - 132
  • [5] On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks
    Kroell, Markus
    Pichler, Reinhard
    Woltran, Stefan
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1145 - 1152
  • [6] A Comparative Test on the Enumeration of Extensions in Abstract Argumentation
    Bistarelli, Stefano
    Rossi, Fabio
    Santini, Francesco
    FUNDAMENTA INFORMATICAE, 2015, 140 (3-4) : 263 - 278
  • [7] Computing Grounded Extensions Of Abstract Argumentation Frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    COMPUTER JOURNAL, 2021, 64 (01): : 54 - 63
  • [8] Efficiently Estimating the Probability of Extensions in Abstract Argumentation
    Fazzinga, Bettina
    Flesca, Sergio
    Parisi, Francesco
    SCALABLE UNCERTAINTY MANAGEMENT, SUM 2013, 2013, 8078 : 106 - 119
  • [9] A tool for merging extensions of abstract argumentation frameworks
    Delobelle, Jerome
    Mailly, Jean-Guy
    ARGUMENT & COMPUTATION, 2022, 13 (03) : 361 - 368
  • [10] On Scaling the Enumeration of the Preferred Extensions of Abstract Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1147 - 1153