Homomorphisms of conjunctive normal forms Original Research Article

We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If ϕ : H→F is a homomorphism, then unsatisfiability of H implies unsatisfiability of F. Homomorphisms from F to a subset F′ of F (endomorphisms) are of special interest, since in such cases F and F′ are satisfiability-equivalent. We show that the smallest subsets F′ of a formula F for which an endomorphism F→F′ exists are mutually isomorphic. Furthermore, we study connections between homomorphisms and autark assignments. We introduce the concept of “proof by homomorphism” which is based on the observation that there exist sets Γ of unsatisfiable formulas such that (i) formulas in Γ can be recognized in polynomial time, and (ii) for every unsatisfiable formula F there exist some H∈Γ and a homomorphism ϕ : H→F. We identify several sets Γ of unsatisfiable formulas satisfying (i) and (ii) for which proofs by homomorphism w.r.t. Γ and tree resolution proofs can be simulated by each other in polynomial time.