常見(jiàn)例句The principle and method for transforming CNF to (r,s)-CNF and constructing unsatisfiable formulas in (r,s)-CNF are presented. 并且;給出了CNF到(r;s)-CNF公式轉(zhuǎn)換以及(r;s)-CNF中不可滿足公式構(gòu)造的原理和方法.A CNF formula F is minimal unsatisfiable (MU) if F is unsatisfiable and deleting an arbitrary clause results a satisfiable formula. 一個(gè)CNF公式F稱為極小不可滿足的(MU),如果F是不可滿足,并且在F中刪去任意一個(gè)子句后所得到的公式是可滿足的。A CNF formula F is minimal unsatisfiable if F is unsatisfiable and the resulting formula deleting anyone clause from F is satisfiable. 一個(gè)公式是極小不可滿足的是指公式不可滿足而且從中刪去任一個(gè)子句后得到的公式可滿足。A CNF formula F is minimally unsatisfiable if F is unsatisfiable and the resulting formula deleting any one clause from F is satisfiable. 一個(gè)公式是極小不可滿足的是指該公式本身不可滿足;而且從中刪去任意一個(gè)子句后得到的公式可滿足.Finally, we discuss the current challenges of methods to extract Boolean unsatisfiable subformulae, and outline the future research directions. 最后討論了布爾不可滿足子式的求解方法目前面臨的主要挑戰(zhàn),并對(duì)今后的研究方向進(jìn)行了展望。We proved that in the case where each constraint is easy to satisfy, Model GB exhibits non-trivial behavior (not trivially satisfiable or unsatisfiable). 本文證明了當(dāng)模型GB的約束容易滿足時(shí),該模型表現(xiàn)出非平凡的漸進(jìn)行為(既不是平凡有解的也不是平凡無(wú)解的)。 返回 unsatisfiable