强可容许性,一种易处理的数学方法(证明)
Strong Admissibility, a Tractable Algorithmic Approach (proofs)
摘要:
就像可容许性是优先语义的关键概念一样,强可容许性是扎根语义的关键概念,因为强可容许集合的成员资格足以显示扎根扩展的成员资格。因此,强可容许集合和标记可以被用来解释接地扩展的成员资格,例如在接地语义的一些证明过程中所做的。在目前的文件中,我们提出了两个多项式算法构造相对较小的强容许标号,与相关的最小最大数,为一个特定的参数。这些标记可以被用来作为相对较小的解释的论点的成员资格的接地扩展。虽然我们的算法不能保证产生一个绝对最小的强可接受标签的参数(这样做将意味着指数复杂度),我们的最佳性能算法产生的结果,只是稍微大一点。此外,该算法的运行时间是一个数量级小于现有的方法来计算一个特定的参数的绝对最小强容许标签。因此,我们相信,我们的算法可以是实用价值的情况下,其目的是构建一个最小或接近最小的强容许标签的时间效率的方式。
英文摘要:
Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded extension. As such, strongly admissible sets and labellings can be used as an explanation of membership of the grounded extension, as is for instance done in some of the proof procedures for grounded semantics. In the current paper, we present two polynomial algorithms for constructing relatively small strongly admissible labellings, with associated min-max numberings, for a particular argument. These labellings can be used as relatively small explanations for the argument's membership of the grounded extension. Although our algorithms are not guaranteed to yield an absolute minimal strongly admissible labelling for the argument (as doing do would have implied an exponential complexity), our best performing algorithm yields results that are only marginally bigger. Moreover, the runtime of this algorithm is an order of magnitude smaller than that of the existing approach for computing an absolute minimal strongly admissible labelling for a particular argument. As such, we believe that our algorithms can be of practical value in situations where the aim is to construct a minimal or near-minimal strongly admissible labelling in a time-efficient way.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。