Probabilistic qualification of attack in abstract argumentation
Probabilistic qualification of attack in abstract argumentation
复制标题
DOI：
10.1016/j.ijar.2013.09.002
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
A. Hunter
中科院分区：
文献类型：
--
作者：
A. Hunter
一个参数图是一个图，其中每个节点表示一个参数，每个弧表示一个参数对另一个参数的攻击。它提供了一个有价值的出发点，为理论分析的论证后，建议的Dung。然而，参数图的定义没有考虑攻击中的信念。特别是，当从非正式的参数中构建参数图时，其中每个参数都在自由文本中描述，通常很明显，对于某些攻击是否成立存在不确定性。这可能是因为有人对攻击是否成立表示怀疑，或者是因为论点中使用的语言有些不准确。在本文中，我们使用一个参数图的生成子图的集合作为一个样本空间。一个生成子图包含所有的参数，和攻击的一个子集，参数图。我们给每个生成子图分配一个概率值，使得分配的总和为1。这意味着我们可以使用这个概率分布来反映实际子图的不确定性。使用子图上的概率分布，我们可以确定一组参数是可容许的或扩展的概率。我们还可以获得原始参数图中攻击关系的概率作为边际分布（即，它是分配给包含该攻击关系的每个子图的概率之和）。我们调查的一些功能，这个建议，我们认为我们的框架捕获一些实际的论证方案的效用。
An argument graph is a graph where each node denotes an argument, and each arc denotes an attack by one argument on another. It offers a valuable starting point for theoretical analysis of argumentation following the proposals by Dung. However, the definition of an argument graph does not take into account the belief in the attacks. In particular, when constructing an argument graph from informal arguments, where each argument is described in free text, it is often evident that there is uncertainty about whether some of the attacks hold. This might be because there is some expressed doubt that an attack holds or because there is some imprecision in the language used in the arguments. In this paper, we use the set of spanning subgraphs of an argument graph as a sample space. A spanning subgraph contains all the arguments, and a subset of the attacks, of the argument graph. We assign a probability value to each spanning subgraph such that the sum of the assignments is 1. This means we can reflect the uncertainty over which is the actual subgraph using this probability distribution. Using the probability distribution over subgraphs, we can then determine the probability that a set of arguments is admissible or an extension. We can also obtain the probability of an attack relationship in the original argument graph as a marginal distribution (i.e. it is the sum of the probability assigned to each subgraph containing that attack relationship). We investigate some of the features of this proposal, and we consider the utility of our framework for capturing some practical argumentation scenarios.