软件学报
軟件學報
연건학보
JOURNAL OF SOFTWARE
2014年
6期
1225-1238
,共14页
辩论模型%不确定性%可信度%争议评价算法
辯論模型%不確定性%可信度%爭議評價算法
변론모형%불학정성%가신도%쟁의평개산법
argumentation model%uncertainty%certainty-factor%algorithms of argument evaluation
辩论是智能主体间为了消除分歧的一种基于言语的交互行为。由于知识的局限性,争议以及争议内部的陈述通常存在不确定性,因此在对辩论进行建模时需要考虑不确定信息处理问题。提出一种基于可信度的辩论模型(CFA),该模型将争议表示为由若干前提和一个结论组成的可废止规则,并用对话树描述辩论推演过程。为了表示不确定性推理,引入可信度模型,将争议前提的不确定性和争议之间的攻击强度统一用可信度因子表示。在此基础上,提出计算陈述可信度的争议评价算法,并通过设定可信度阈值确定陈述的可接受性,得出最终辩论结果。最后,用一个实例说明该方法的有效性。该模型可以有效处理不确定信息条件下辩论推理过程,其辩论算法建立在数值计算基础之上,所得出的可接受陈述集在给定可信度阈值条件下是唯一的,可以克服 Dung 的抽象辩论框架中扩充语义的不足。
辯論是智能主體間為瞭消除分歧的一種基于言語的交互行為。由于知識的跼限性,爭議以及爭議內部的陳述通常存在不確定性,因此在對辯論進行建模時需要攷慮不確定信息處理問題。提齣一種基于可信度的辯論模型(CFA),該模型將爭議錶示為由若榦前提和一箇結論組成的可廢止規則,併用對話樹描述辯論推縯過程。為瞭錶示不確定性推理,引入可信度模型,將爭議前提的不確定性和爭議之間的攻擊彊度統一用可信度因子錶示。在此基礎上,提齣計算陳述可信度的爭議評價算法,併通過設定可信度閾值確定陳述的可接受性,得齣最終辯論結果。最後,用一箇實例說明該方法的有效性。該模型可以有效處理不確定信息條件下辯論推理過程,其辯論算法建立在數值計算基礎之上,所得齣的可接受陳述集在給定可信度閾值條件下是唯一的,可以剋服 Dung 的抽象辯論框架中擴充語義的不足。
변론시지능주체간위료소제분기적일충기우언어적교호행위。유우지식적국한성,쟁의이급쟁의내부적진술통상존재불학정성,인차재대변론진행건모시수요고필불학정신식처리문제。제출일충기우가신도적변론모형(CFA),해모형장쟁의표시위유약간전제화일개결론조성적가폐지규칙,병용대화수묘술변론추연과정。위료표시불학정성추리,인입가신도모형,장쟁의전제적불학정성화쟁의지간적공격강도통일용가신도인자표시。재차기출상,제출계산진술가신도적쟁의평개산법,병통과설정가신도역치학정진술적가접수성,득출최종변론결과。최후,용일개실례설명해방법적유효성。해모형가이유효처리불학정신식조건하변론추리과정,기변론산법건립재수치계산기출지상,소득출적가접수진술집재급정가신도역치조건하시유일적,가이극복 Dung 적추상변론광가중확충어의적불족。
Argumentation is a kind of interaction between agents for resolving differences in speech. Due to the limitation of knowledge, arguments and its inner statements are usually uncertain, and therefore it is necessary to consider uncertain information processing when modeling the process of argumentation. This paper proposes an argumentation model based on the theory of certainty-factor, in which an argument is expressed as a defeasible rule with several premises but only one conclusion, and the process of argumentation is described as a dialogue tree. In order to do uncertain reasoning, the uncertainty of argument’s premise and the strength of the attack that one argument makes against another are assigned with certainty-factors. Next, the algorithms of argument evaluation are provided to compute the credibility of statements. Using the algorithms the set of acceptable arguments can be determined by the credibility threshold and the result of argumentation can be obtained. Finally, an example is given to illustrate the validity of the method. The algorithms are based on numerical computation where the set of acceptable arguments is unique under a given credibility threshold, and can overcome the shortage of extension semantics of Dung’s abstract argumentation framework.