%0 Journal Article
%T Some Hard Examples for the Resolution Method
%A Yu
%A Xiangdong
%J 计算机科学技术学报
%D 1990
%I 
%X Given n propositional variables,let Kn(i,j),0≤i≤j≤n,be the set(or disjunction)of all conjunctions of i literals of which exactly j literals are negative.Dunham and Wang conjectured that it may require exponential time to decide that every disjunction Kn(i,j)is not valid by the resolution metho.This paper gives a proof of the conjecture and then exhibits a new counterexample to the feasibility of the resolution or consensus method.
%K MP问题
%K 可行性算法
%K 分解方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=3EC7E3576AFD11494817F6175E09045A&yid=8D39DA2CB9F38FD0&vid=94C357A881DFC066&iid=38B194292C032A66&sid=119B6C0AA09DE6B9&eid=8ED630AD8C61FAE8&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=0