| 摘要: |
| 提出一种扩展双极辩论模型EBAF(extended bipolar argumentation framework).该模型不仅包括攻击和支援两种独立的语义关系,还允许攻击和支援的递归交互,即对攻击和支援关系进行攻击或支援,且递归次数不受限制.围绕该模型的可接受集合的确定问题,首先将该模型中的攻击和支援关系进行分离,得到攻击辩论框架和支援辩论框架;然后将攻击关系和支援关系作为实体,把递归攻击和递归支援转化为关系视角下的攻击和支援.在此基础上,定义了EBAF 的基本语义概念和可接受集合,并给出了可接受集合的确定算法.最后将EBAF 与其他相关辩论模型进行了比较. |
| 关键词: 双极辩论模型 递归攻击与支援 辩论语义 可接受集合确定算法 |
| DOI：10.3724/SP.J.1001.2012.04067 |
| 分类号: |
| 基金项目:国家自然科学基金(91024006); 国家教育部博士点基金(20104307120020) |
|
| Extended Bipolar Argumentation Model |
|
CHEN Jun-Liang, WANG Chang-Chun, CHEN Chao
|
|
Science and Technology on Information Systems Engineering Laboratory, College of Information System and Management, National University of Defense Technology, Changsha 410073, China
|
| Abstract: |
| This paper proposes an extended bipolar argumentation model, named extended bipolar argumentation framework (EBAF). In this model, attack and support relations are considered as two independent semantic relations and there exist recursive interactions among attacks and supports. In other words, there are attacks or supports for the attack and support relations without limits. This paper focuses on the determination of acceptable set of EBAF. First the attack and support relations are separated, and the argumentation framework with only attack and support relations are obtained as results. Second the attacks and supports are considered as entities that convert the recursive attacks and supports into attacks and supports under relation perspective. On this basis, basic semantic concepts and acceptability of EBAF are defined and the determination algorithm of acceptable set of EBAF is provided. Finally, this paper provides a comparison with other relative argumentation models. |
| Key words: bipolar argumentation model recursive attack and support argumentation semantics extension determination algorithm |
