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 条