%0 Journal Article
%T Fast Algorithms for Revision of Some Special Propositional Knowledge Bases
%A Luan ShangMin
%A GuoZhong Dai
%A <br>栾尚敏
%A 戴国忠
%J 计算机科学技术学报
%D 2003
%I 
%X In this paper, the computational complexity of propositional clause set counterfactuals is discussed. It is shown that the computational complexity of propositional clause set counterfactuals is at the second level of the polynomial hierarchy, and that the computational complexity of propositional Horn clause set counterfactuals is at the first level of the polynomial hierarchy. Furthermore, some polynomial algorithms are presented for some special propositional clause set, such as the unique satisfiable clause set and the clause set of which only one subset is minimally inconsistent with the input clause whose inconsistency check can be solved in polynomial time. This work is supported by the National Natural Sciences Foundation of China under Grant Nos.60033020 and 60103020 and the China Postdoctoral Foundation of Sciences.
%K propositional base revision
%K computational complexity
%K polynomial algorithm<br>命题修正
%K 计算复杂性
%K 多项式算法
%K 知识库
%K 接口系统
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=D8DD0268F667183889B9FC695458F797&yid=D43C4A19B2EE3C0A&vid=13553B2D12F347E8&iid=38B194292C032A66&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=19