Epistemic argumentation framework: Theory and computation

被引:0
|
作者
Sakama C. [1 ]
Son T.C. [2 ]
机构
[1] Wakayama University, 930 Sakaedani, Wakayama
[2] New Mexico State University, Las Cruces, 88003, NM
基金
美国国家科学基金会;
关键词
43;
D O I
10.1613/JAIR.1.12121
中图分类号
学科分类号
摘要
The paper introduces the notion of an epistemic argumentation framework (EAF) as a means to integrate the beliefs of a reasoner with argumentation. Intuitively, an EAF encodes the beliefs of an agent who reasons about arguments. Formally, an EAF is a pair of an argumentation framework and an epistemic constraint. The semantics of the EAF is defined by the notion of an ω-epistemic labelling set, where ω is complete, stable, grounded, or preferred, which is a set of ω-labellings that collectively satisfies the epistemic constraint of the EAF. The paper shows how EAF can represent different views of reasoners on the same argumentation framework. It also includes representing preferences in EAF and multi-agent argumentation. Finally, the paper discusses complexity issues and computation using epistemic logic programming. © 2020 AI Access Foundation. All rights reserved.
引用
收藏
页码:1103 / 1126
页数:23
相关论文
共 50 条
  • [21] Computation in Extended Argumentation Frameworks
    Dunne, Paul E.
    Modgil, Sanjay
    Bench-Capon, Trevor
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 119 - 124
  • [22] Epistemic Argumentation with Conditional Probabilities and Labeling Constraints
    de Bona, Glauber
    Nascimento Rocha, Victor Hugo
    Cozman, Fabio Gagliardi
    PROCEEDINGS OF THE TWELVETH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITY: THEORIES AND APPLICATIONS, 2021, 147 : 100 - 109
  • [23] Argumentation, cognition, and the epistemic benefits of cognitive diversity
    Renne Pesonen
    Synthese, 200
  • [24] Learning Constraints for the Epistemic Graphs Approach to Argumentation
    Hunter, Anthony
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 239 - 250
  • [25] Representing Epistemic Uncertainty by Means of Dialectical Argumentation
    Peter McBurney
    Simon Parsons
    Annals of Mathematics and Artificial Intelligence, 2001, 32 : 125 - 169
  • [27] A Paraconsistent Approach to Deal with Epistemic Inconsistencies in Argumentation
    Silva, Rafael
    Alcantara, Joao
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2021, 2021, 12897 : 187 - 200
  • [28] Representing epistemic uncertainty by means of dialectical argumentation
    McBurney, P
    Parsons, S
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2001, 32 (1-4) : 125 - 169
  • [29] Polynomial-Time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation
    Potyka, Nico
    Polberg, Sylwia
    Hunter, Anthony
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2019, 2019, 11726 : 74 - 86
  • [30] Computation of Reliability with both Aleatory and Epistemic Uncertainty Based on Random Sets Theory
    Guo, Huixin
    Chen, Lei
    He, Hangmin
    Lin, Daiyong
    APPLIED MECHANICS AND MECHANICAL ENGINEERING, PTS 1-3, 2010, 29-32 : 1252 - 1257