子句型缺省逻辑中的分情形推理(英文)  

On Reasoning by Cases in Clausal Default Logic

作　　者：许道云[1] 丁德成[1] 张明义[2] 

机构地区：[1]南京大学数学系,江苏南京210093 [2]贵州科学院,贵州贵阳550001

出　　处：《软件学报》2001年第8期1140-1146,共7页Journal of Software

摘　　要：引进一种树型方法以研究缺省逻辑中分情形推理下的 Roos扩张 ,深入讨论了 Roos扩张的计算 ,并分析了Roos扩张与 Reiter扩张的关系 .为计算 Roos扩张 ,引入了从子句集分解最小文字集的算法 .方法对于在缺省逻辑中计算A kind of tree method is proposed to investigate Roos' extensions about the reasoning by cases in default logic, we discuss deeply the computation of Roos' extensions and analyze the relationship between Roos' extensions and Reiter's extensions. The algorithm decomposing the smallest set of literals from a set of clauses is presented to compute Roos' extensions. The method is useful for computing Roos' extensions and analyzing the complexity of reasoning by cases in default logic.

关 键 词：分情形推理 子句型缺省逻辑 Roos扩张 计算复杂性 

分 类 号：TP301.5[自动化与计算机技术—计算机系统结构]