一种渐进式论辩语义的论证博弈模型

发布时间：2018-07-02 13:01

  本文选题：结构化论辩框架 + 渐进式论辩语义　； 参考：《计算机科学》2017年04期

【摘要】：在可计算论辩模型中,论辩语义的证明理论解决如何判定给定论辩语义中某个论证的证成状态的问题,这通常需要建构与之对应的论证博弈模型。论证博弈发生在正方和反方的论证交互过程中,正反双方都是通过给出攻击论证来质疑对方的论证和辩护己方的论证,正方只有在论证博弈中获胜才能使其初始论证获得确定的证成状态。文中定义了一种被称为BRD-论辩语义的渐进式论辩语义,不同于Dung的抽象论辩语义,它是在结构化论辩框架ASPIC+中嵌入了一种用于计算论证的强度和证成度的循环语义。为了给出该语义的证明理论,建构了与之对应的论证博弈模型。
[Abstract]:In the computable argumentative model, the proof theory of argumentative semantics solves the problem of how to determine the state of evidence to a certain argument in the set argument semantics. It usually needs to construct an argument game model corresponding to it. It is different from the abstract argumentation meaning called BRD- argumentation meaning that it is different from the abstract argumentation meaning of Dung, which is embedded in the framework of the framework of argumentation ASPIC+. In order to give the circular semantics of strength and degree of proof, a game model of argumentation is constructed to give the proof theory of the semantics.
【作者单位】： 西南政法大学;
【基金】：重庆市教委科学技术项目(KJ1500103)资助
【分类号】：TP18;O225
，

本文编号：2090207