概率认知论证片段中认知状态的多项式时间更新(技术报告)
Polynomial-time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation (Technical Report)
摘要:
概率认识论论证允许以概率论为基础的方式对论证问题进行推理。认知状态由可能世界上的概率函数表示,并且可以使用更新算子调整到新的信念。虽然概率函数的使用为这种方法提供了坚实的基础,但它也带来了计算挑战,因为要处理的数据量以指数方式取决于参数的数量。这导致了应用中的瓶颈,例如为说服对话建模对手的信念。我们展示了如何更新运营商的概率函数可以与更新运营商更紧凑的表示,允许多项式时间更新。我们讨论了这种方法的认知和概率逻辑的可行性,并证明了它在计算说服的适用性。
英文摘要:
Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way that is well founded by probability theory. Epistemic states are represented by probability functions over possible worlds and can be adjusted to new beliefs using update operators. While the use of probability functions puts this approach on a solid foundational basis, it also causes computational challenges as the amount of data to process depends exponentially on the number of arguments. This leads to bottlenecks in applications such as modelling opponent's beliefs for persuasion dialogues. We show how update operators over probability functions can be related to update operators over much more compact representations that allow polynomial-time updates. We discuss the cognitive and probabilistic-logical plausibility of this approach and demonstrate its applicability in computational persuasion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。