| 摘要: |
| 由鸽巢原理定义的鸽巢公式PHnn+1 是著名的消解难例之一,研究该公式的结构和性质有助于其他难例的构造.证明了PHnn+1 是一个极小不可满足公式,根据其极小不可满足性,给出了最大可满足真值指派的两种标准形式,Haken 关于PHnn+1 的难解证明用到了其中一种标准形式.公式PHnn+1 具有良好的子结构同构性质,如果DPLL 算法中允许使用同构规则,则存在PHnn+1 的反驳证明,其复杂性可以降至O(n3). |
| 关键词: 鸽巢公式 极小不可满足 最大可满足指派 标准形式 子结构同构 |
| DOI：10.3724/SP.J.1001.2011.03957 |
| 分类号: |
| 基金项目:国家自然科学基金(60863005, 61111130186) |
|
| Some Properties of Pigeon-Hole Formulas |
|
XU Dao-Yun, WEI Li, WANG Xiao-Feng
|
|
Department of Computer Science, Guizhou University, Guiyang 550025, China
|
| Abstract: |
| The pigeon-hole formula PHnn+1, 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 PHnn+1 is a minimal unsatisfiable formula. The two normal forms of maximal satisfiable truth assignments for PHnn+1 are presented by the minimal unsatisfiability of PHnn+1, which one of normal forms is used in Haken’s proof of hardness for PHnn+1. The formula PHnn+1 has well isomorphics properties on substructures. For the modified DPLL algorithm introduced by the isomorphism rule, the complexity of refutation proof of PHnn+1 can be reduced to O(n3). |
| Key words: pigeon-hole formula minimal unsatisfiability maximal satisfiable assignment normal form substructure isomorphism |
