运用博弈论分析正当性
Exploiting Game Theory for Analysing Justifications
摘要：
理据理论是一个统一的语义框架。虽然它起源于非单调逻辑，但它可以应用于计算机科学的各个领域，特别是可解释推理;它最核心的概念是证明：解释为什么一个属性在模型中成立（或不成立）。在本文中，我们继续研究的理由理论的三个主要贡献。第一部分研究了辩护理论与博弈论的关系。我们证明，理由框架可以被看作是一种特殊类型的游戏。建立的联系为我们接下来的两个贡献提供了理论基础。第二个贡献是研究在什么条件下两种不同的证明理论方言（图作为解释与树作为解释）重合。第三个贡献是建立了一个精确的标准时，语义诱导的理由理论产生一致的结果。在过去，要证明这样的语义是一致的，需要繁琐而复杂的证明。我们表明，这些标准确实满足所有常见的语义逻辑编程。本文正在考虑接受逻辑编程理论与实践（TPLP）。
英文摘要：
Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning; its most central concept is a justification: an explanation why a property holds (or does not hold) in a model. In this paper, we continue the study of justification theory by means of three major contributions. The first is studying the relation between justification theory and game theory. We show that justification frameworks can be seen as a special type of games. The established connection provides the theoretical foundations for our next two contributions. The second contribution is studying under which condition two different dialects of justification theory (graphs as explanations vs trees as explanations) coincide. The third contribution is establishing a precise criterion of when a semantics induced by justification theory yields consistent results. In the past proving that such semantics were consistent took cumbersome and elaborate proofs. We show that these criteria are indeed satisfied for all common semantics of logic programming. This paper is under consideration for acceptance in Theory and Practice of Logic Programming (TPLP).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
