超协调限制逻辑的计算复杂性分析  

An Analysis on Complexity of Paraconsistent Circumscription

作　　者：蔡和熙[1] 林作铨[1] 

机构地区：[1]汕头大学计算机科学研究所

出　　处：《软件学报》1998年第11期839-844,共6页Journal of Software

基　　金：国家自然科学基金;国家863高科技项目基金;广东省自然科学基金

摘　　要：超协调限制逻辑ＬＰｃ是一种同时具有非单调性和超协调性的非经典逻辑，它可作为在不完全与不协调知识下常识推理的形式化．给出了命题ＬＰｃ的计算复杂性结果和算法实现，指出ＬＰｃ是ＮＰ完全问题，并给出了将ＬＰｃ转化为等价的优先限制逻辑的线性时间算法，由于限制逻辑具有实用的实现算法且可用归结方法实现，因而该算法为ＬＰｃ的实现提供了新的途径．Paraconsistent circumscription LPc is a non classical logic which has both nonmonotonicity and paraconsistency. It can be viewed as a formalism of commonsense reasoning with incomplete and inconsistent knowledge. In this paper, the results of computational complexity on propositional LPc and its implementation algorithm is presented. It is showed that LPc is NP complete. A linear algorithm to transform LPc into equivalent prioritized circumscription is provided. Because there are a number of useful algorithms for circumscription which could be implemented by resolution, a new way to implementation of LPc is drawn.

关 键 词：悖论逻辑 限制逻辑 计算复杂性 非单调性 

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