A Practical Parallel Algorithm for Propositional Knowledge Base Revision

作     者：SUN WEI TAO XUEHONG and MA SHAOHAO(Dept. of Computer Science, Shandong University, Jinan 250100,P.R.China) 

作者机构：Dept. of Computer Science Shandong University Jinan P.R. China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：1996年第1卷第Z1期

页      面：473-477页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

主　　题：Prepositional knowledge base revision parallel algorithm satisfiability problem strongly connected component of a graph. 

摘      要：Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method in special case, and gives a corresponding polynomial algorithm as well as its parallel version on CREW PRAM.