Optimization of dialectical outcomes in dialogical argumentation
Optimization of dialectical outcomes in dialogical argumentation
复制标题
对话论证中辩证结果的优化
DOI：
10.1016/j.ijar.2016.06.014
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Matthias Thimm
中科院分区：
文献类型：
--
作者：
A. Hunter;Matthias Thimm
当呈现非正式的论点时，所使用的语言可能不精确，因此观众可能不确定论点呈现者所意图的论点图的结构。对于论证的陈述者来说，了解听众的论证图是很有用的，但是陈述者可能不确定它的结构。为了在这种情况下对论证图结构的不确定性进行建模，我们可以使用概率论证图。一个参数图的子图的集合是一个样本空间。概率值被分配给每个子图，使得总和为1，从而反映实际子图的不确定性。然后，我们可以根据特定的Dung语义确定特定参数集被包含或排除在扩展之外的概率。我们代表和理由与扩展从一个图和它的子图，使用逻辑的辩证outcomes，我们目前。我们利用这一点来定义的概念anargumentation彩票，它可以被观众用来确定预期效用的辩论，并可以被用于演示者来决定哪些参数，目前通过选择那些最大化的预期效用。我们调查了一些使用论证彩票的选项，并提供了一个计算评估。
When informal arguments are presented, there may be imprecision in the language used, and so the audience may be uncertain as to the structure of the argument graph as intended by the presenter of the arguments. For a presenter of arguments, it is useful to know the audience's argument graph, but the presenter may be uncertain as to the structure of it. To model the uncertainty as to the structure of the argument graph in situations such as these, we can use probabilistic argument graphs. The set of subgraphs of an argument graph is a sample space. A probability value is assigned to each subgraph such that the sum is 1, thereby reflecting the uncertainty over which is the actual subgraph. We can then determine the probability that a particular set of arguments is included or excluded from an extension according to a particular Dung semantics. We represent and reason with extensions from a graph and from its subgraphs, using alogic of dialectical outcomesthat we present. We harness this to define the notion of anargumentation lottery, which can be used by the audience to determine the expected utility of a debate, and can be used by the presenter to decide which arguments to present by choosing those that maximize expected utility. We investigate some of the options for using argumentation lotteries, and provide a computational evaluation.