A Probabilistic Semantics for Abstract Argumentation

被引:106
|
作者
Thimm, Matthias [1 ]
机构
[1] Univ Koblenz Landau, Inst Web Sci & Technol, Landau, Germany
关键词
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] The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
    Dunne, Paul E.
    COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008, 2008, 172 : 147 - 158
  • [42] Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
    Alfano, Gianvincenzo
    Calautti, Marco
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    ARTIFICIAL INTELLIGENCE, 2023, 323
  • [43] On Relating Abstract and Structured Probabilistic Argumentation: A Case Study
    Prakken, Henry
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2017, 2017, 10369 : 69 - 79
  • [44] A general approach to extension-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    ARTIFICIAL INTELLIGENCE, 2023, 315
  • [45] On the Complexity of Determining Defeat Relations Consistent with Abstract Argumentation Semantics
    Mumford, Jack
    Sassoon, Isabel
    Black, Elizabeth
    Parsons, Simon
    COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 260 - 271
  • [46] A Comparative Study of Ranking-Based Semantics for Abstract Argumentation
    Bonzon, Elise
    Delobelle, Jerome
    Konieczny, Sebastien
    Maudet, Nicolas
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 914 - 920
  • [47] Incremental Computation of Grounded Semantics for Dynamic Abstract Argumentation Frameworks
    Greco, Sergio
    Parisi, Francesco
    CONFLICT RESOLUTION IN DECISION MAKING, COREDEMA 2016, 2017, 10238 : 66 - 81
  • [48] Combining Extension-Based Semantics and Ranking-Based Semantics for Abstract Argumentation
    Bonzon, Elise
    Delobelle, Jerome
    Konieczny, Sebastien
    Maudet, Nicolas
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 118 - 127
  • [49] Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6362 - 6366
  • [50] Reduced meet over labelling-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    INFORMATION PROCESSING LETTERS, 2025, 187