摘要
由鸽巢原理定义的鸽巢公式PH nn+1是著名的消解难例之一,研究该公式的结构和性质有助于其他难例的构造.证明了PH nn+1是一个极小不可满足公式,根据其极小不可满足性,给出了最大可满足真值指派的两种标准形式,Haken关于PH nn+1的难解证明用到了其中一种标准形式.公式PH nn+1具有良好的子结构同构性质,如果DPLL算法中允许使用同构规则,则存在PH nn+1的反驳证明,其复杂性可以降至O(n3).
The pigeon-hole formula,defined from the pigeon hole principles,is one of the hardest examples on resolution.The research of the formula’s constructions and properties is helpful for constructing other hard examples.It is shown that is a minimal unsatisfiable formula.The two normal forms of maximal satisfiable truth assignments for are presented by the minimal unsatisfiability of,which one of normal forms is used in Haken’s proof of hardness for.The formula has well isomorphics properties on substructures.For the modified DPLL algorithm introduced by the isomorphism rule,the complexity of refutation proof of can be reduced to O（n^3）.
出处
《软件学报》
EI
CSCD
北大核心
2011年第11期2553-2563,共11页
Journal of Software
基金
国家自然科学基金(60863005
61111130186)
关键词
鸽巢公式
极小不可满足
最大可满足指派
标准形式
子结构同构
pigeon-hole formula
minimal unsatisfiability
maximal satisfiable assignment
normal form
substructure isomorphism
