An Explicit Semidefinite Characterization of Satisfiability for Tseitin Instances

This paper is concerned with the application of semidefinite programming to the satisfiability problem, and in particular with using semidefinite liftings to efficiently obtain proofs of unsatisfiability. We focus on the Tseitin satisfiability instances which are known to be hard for many proof systems. We present an explicit semidefinite programming problem with dimension linear in the size of the Tseitin instance, and prove that it characterizes the satisfiability of these instances, thus providing an explicit certificate of satisfiability or unsatisfiability in polynomial-time.


Annals of Mathematics and Artificial Intelligence, Vol. 47 (3-4), 2006, 1-14.