不可满足公式同态证明系统.pdfVIP

1000-9825/2005/16(03)0336 ©2005 Journal of Software 软 件 学 报 Vol.16, No.3 ∗ 不可满足公式的同态证明系统 许道云+ (贵州大学 计算机科学系,贵州 贵阳 550025) Homomorphism Proof Systems for Unsatisfiable Formulas + XU Dao-Yun (Department of Computer Science, Guizhou University, Guiyang 550025, China) + Corresponding author: Phn: +86-851-3627649, E-mail: daoyun.gzu@263.net Received 2003-08-29; Accepted 2004-10-09 Xu DY. Homomorphism proof systems for unsatisfiable formulas. Journal of Software, 2005,16(3):336−345. DOI: 10.1360/jos160336 Abstract: A homomorphism ϕ of CNF formulas from H to F is a function mapping the set of literals in H to the set of literals in F and it preserves complements and clauses. If the formula H is homomorphic to the formula F , then the unsatisfiability of H implies the unsatisfiability of F . A CNF formula F is minimally unsatisfiable if F is unsatisfiable and the resulting formula deleting any one clause from F is satisfiable. MU (1) is a class of minimally unsatisfiable formulas with the deficiency of the number of clauses and variables to be one. A triple (H ,ϕ,F) is called a homomorphism proof from H of F if ϕ is a homomorphism from H to F . In this paper, a method from the basic matrix of MU ( 1) formula is used to prove that a tree resolution proof for an unsatisfiable formula F can be transformed into a homomorphism proof from a MU (1) formula for F . Whence, the homomorphism proof system from formulas in MU ( 1) is complete, and this proof system and the tree resolution proof system can be transformed mutually in polynomial time on the size of proof. Key words: unsatisfiable formulas; homomorphism; proof system; basic matrix; completeness 摘 要: 合取范式(CNF)公式 H 到 F 的同态ϕ是一个从 H 的文字集合到 F 的文字集合的映射,并保持补运算和子 句映到子句.同态映射保持一个公式的不可满足性.一个公式是极小不可满足的是指该公式本