.png){kind=icon}
返回
Weighted argument systems: Basic definitions, algorithms, and complexity results
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2010.09.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce and investigate a natural extension of Dung's well-known model of argument systems in which attacks are associated with a weight, indicating the relative strength of the attack. A key concept in our framework is the notion of an inconsistency budget, which characterises how much inconsistency we are prepared to tolerate: given an inconsistency budget beta, we would be prepared to disregard attacks up to a total weight of beta. The key advantage of this approach is that it permits a much finer grained level of analysis of argument systems than unweighted systems, and gives useful solutions when conventional (unweighted) argument systems have none. We begin by reviewing Dung's abstract argument systems, and motivating weights on attacks (as opposed to the alternative possibility, which is to attach weights to arguments). We then present the framework of weighted argument systems. We investigate solutions for weighted argument systems and the complexity of computing such solutions, focussing in particular on weighted variations of grounded extensions. Finally, we relate our work to the most relevant examples of argumentation frameworks that incorporate strengths. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Argumentation
Handling inconsistency
Computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
The genome sequence of the rice blast fungus Magnaporthe grisea稻瘟病菌Magnaporthe grisea的基因组序列.png)
NatureOAAI
NatureIF0
OAAI分享收藏
查看更多内容