arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.1647cs.LO
收藏

计算共识:一种基于论证的审议过程推理逻辑

Computing consensus: A logic for reasoning about deliberative processes based on argumentation

Truls Pedersen, Sjur Dyrkolbotn

摘要:

我们认为多代理论证,每个代理的观点的参数编码为一个论证框架(AF)。然后,我们研究审议过程比可以在此基础上发生。我们认为审议过程是一个单一的联合AF的逐步聚合的形状,我们感兴趣的是对可能结果的空间进行推理。我们对审议过程的唯一限制是,它们应该满足忠实性,这一假设相当于要求,每当审议导致在两个论点之间引入一种新的关系时,这种关系至少要得到一个参与主体的认可。我们使用模态逻辑的原因所产生的审议结构,我们提供了一些技术成果的模型检验。我们也给出了一个例子,并提出了一些未来工作的方向。

英文摘要:

We consider multi-agent argumentation, where each agent's view of the arguments is encoded as an argumentation framework (AF). Then we study deliberative processes than can occur on this basis. We think of a deliberative process as taking the shape of a stepwise aggregation of a single joint AF, and we are interested in reasoning about the space of possible outcomes. The only restriction we place on deliberative processes is that they should satisfy faithfulness, a postulate amounting to requiring that whenever deliberation leads to a new relationship being introduced between two arguments, this relationship is endorsed by at least one participating agent. We use modal logic to reason about the resulting deliberative structures, and we provide some technical results on model checking. We also give an example and suggest some directions for future work.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑