本文選題：結(jié)構(gòu)化論辯框架 + 漸進(jìn)式論辯語義　； 參考：《計算機(jī)科學(xué)》2017年04期

【摘要】：在可計算論辯模型中,論辯語義的證明理論解決如何判定給定論辯語義中某個論證的證成狀態(tài)的問題,這通常需要建構(gòu)與之對應(yīng)的論證博弈模型。論證博弈發(fā)生在正方和反方的論證交互過程中,正反雙方都是通過給出攻擊論證來質(zhì)疑對方的論證和辯護(hù)己方的論證,正方只有在論證博弈中獲勝才能使其初始論證獲得確定的證成狀態(tài)。文中定義了一種被稱為BRD-論辯語義的漸進(jìn)式論辯語義,不同于Dung的抽象論辯語義,它是在結(jié)構(gòu)化論辯框架ASPIC+中嵌入了一種用于計算論證的強(qiáng)度和證成度的循環(huán)語義。為了給出該語義的證明理論,建構(gòu)了與之對應(yīng)的論證博弈模型。
[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.
【作者單位】： 西南政法大學(xué);
【基金】：重慶市教委科學(xué)技術(shù)項(xiàng)目(KJ1500103)資助
【分類號】：TP18;O225
，

本文編號：2090207