Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
复制标题
论证语义算法：将攻击标记为标签参数的泛化
DOI：
--
复制
发表时间：
2014
影响因子：
5
通讯作者：
P. Dunne
中科院分区：
文献类型：
--
作者：
Samer Nofal;Katie Atkinson;P. Dunne
Dung论证框架（AF）是一对（A，R）：A是一组抽象论证，R A×A是一个二元关系，即所谓的攻击关系，用于捕获冲突的论证。用于枚举扩展（即可接受的参数集）的基于“标记”的算法已经被阐述，使得参数（即A的元素）是标记的唯一主题。在本文中，我们提出了实现算法上市扩展标记攻击（即元素的R）沿着与参数。具体来说，这些算法涉及枚举AF的所有扩展下的一些论证语义：首选，稳定，完整，半稳定，阶段，理想和接地。我们的算法的影响，特别是枚举扩展的AF扩展模型，允许攻击的攻击。为了证明这一影响，我们实例化我们的算法，这样的模型的一个例子：即论证框架与递归攻击（AFRA），从而我们最终与统一的算法，枚举任何AF/AFRA的扩展。
A Dung argumentation framework (AF) is a pair (A,R): A is a set of abstract arguments and R ⊆ A×A is a binary relation, so-called the attack relation, for capturing the conflicting arguments. "Labeling" based algorithms for enumerating extensions (i.e. sets of acceptable arguments) have been set out such that arguments (i.e. elements of A) are the only subject for labeling. In this paper we present implemented algorithms for listing extensions by labeling attacks (i.e. elements of R) along with arguments. Specifically, these algorithms are concerned with enumerating all extensions of an AF under a number of argumentation semantics: preferred, stable, complete, semi stable, stage, ideal and grounded. Our algorithms have impact, in particular, on enumerating extensions of AF-extended models that allow attacks on attacks. To demonstrate this impact, we instantiate our algorithms for an example of such models: namely argumentation frameworks with recursive attacks (AFRA), thereby we end up with unified algorithms that enumerate extensions of any AF/AFRA.