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 条
  • [21] New Weak Admissibility Semantics for Abstract Argumentation
    Dauphin, Jeremie
    Rienstra, Tjitze
    van der Torre, Leendert
    LOGIC AND ARGUMENTATION, CLAR 2021, 2021, 13040 : 112 - 126
  • [22] Explaining Semantics and Extension Membership in Abstract Argumentation
    Besnard, Philippe
    Doutre, Sylvie
    Duchatelle, Theo
    Lagasquie-Schiex, Marie-Christine
    INTELLIGENT SYSTEMS WITH APPLICATIONS, 2022, 16
  • [23] Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs
    Liao, Beishui
    Huang, Huaxin
    LOGIC, RATIONALITY, AND INTERACTION (LORI 2015), 2015, 9394 : 243 - 254
  • [24] Probabilistic abstract argumentation: an investigation with Boltzmann machines
    Riveret, Regis
    Korkinof, Dimitrios
    Draief, Moez
    Pitt, Jeremy
    ARGUMENT & COMPUTATION, 2015, 6 (02) : 178 - 218
  • [25] On Partial Information and Contradictions in Probabilistic Abstract Argumentation
    Hunter, Anthony
    Thimm, Matthias
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 53 - 62
  • [26] Dialectical Proof Procedures for Probabilistic Abstract Argumentation
    Phan Minh Thang
    PRIMA 2016: PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS, 2016, 9862 : 397 - 406
  • [27] Probabilistic Abstract Argumentation Based on SCC Decomposability
    Rienstra, Tjitze
    Thimm, Matthias
    Liao, Beishui
    van der Torre, Leendert
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 168 - 177
  • [28] A QBF-based formalization of abstract argumentation semantics
    Arieli, Ofer
    Caminada, Martin W. A.
    JOURNAL OF APPLIED LOGIC, 2013, 11 (02) : 229 - 252
  • [29] Extension Enforcement under Grounded Semantics in Abstract Argumentation
    Niskanen, Andreas
    Wallner, Johannes P.
    Jarvisalo, Matti
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 178 - 182
  • [30] Optimisation and Approximation in Abstract Argumentation: The Case of Stable Semantics
    Thimm, Matthias
    PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 3576 - 3583