A comprehensive study of argumentation frameworks with sets of attacking arguments

International Journal of Approximate Reasoning(2019)

引用 37|浏览66
暂无评分
摘要
It has been argued that Dung's classical Abstract Argumentation Framework (AAF) model is not appropriate for capturing “joint attacks”, a feature that is inherent in several contexts and applications. The model proposed by Nielsen and Parsons in [1], often referred to as “framework with sets of attacking arguments” (SETAF), fills this gap by introducing joint attacks as a generalisation of the standard attack relationship of AAFs, thus constituting a faithful generalization of Dung's model. Building on that work, we provide a more complete characterization of these frameworks, which includes the treatment of various semantics not considered in the original publication, a more fine-grained representation of all acceptability semantics using labellings, and two functions allowing the transition between extensions and labellings along with their properties. Moreover, we show that a variety of well-known results that apply to AAF can be migrated to the SETAF setting. To further associate the two frameworks, we provide a natural way to represent a SETAF as a Dung-style AAF, and show how the generated AAF behaves.
更多
查看译文
关键词
Computational argumentation,Abstract argumentation frameworks,Labellings,Sets of attacking arguments,SETAF,Joint attacks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要