Centrum voor Wiskunde en Informatica REPORTRAPPORT Report SEN-R9903

We derive a semidefinite relaxation of the satisfiability (SAT) problem and discuss its strength. We give both the primal and dual formulation of the relaxation. The primal formulation is an eigenvalue optimization problem, while the dual formulation is a semidefinite feasibility problem. We show that using the relaxation, a proof of the unsatisfiability of the notorious pigeonhole and mutilated chessboard problems can be computed in polynomial time. As a byproduct we find a new `sandwich" theorem that is similar to the sandwich theorem for Lovász' ϑ-function. Furthermore, the semidefinite relaxation gives a certificate of (un)satisfiability for 2SAT problems in polynomial time. By adding an objective function to the dual formulation, a specific class of polynomially solvable 3SAT instances can be identified. We conclude with discussing how the relaxation can be used to solve more general SAT problems and with some empirical observations.

[1]  E. de Klerk,et al.  Interior Point Methods for Semidefinite Programming , 1997 .

[2]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[3]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[5]  Hans van Maaren,et al.  Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations , 2000, Discret. Appl. Math..

[6]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[7]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[8]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[9]  Hans van Maaren,et al.  Solving satisfiability problems using elliptic approximations - effective branching rules , 2000, Discret. Appl. Math..

[10]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[11]  Oliver Kullmann,et al.  Investigations on autark assignments , 2000, Discret. Appl. Math..

[12]  Hans van Maaren,et al.  A two phase algorithm for solving a class of hard satissfiability problems , 1998 .

[13]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[14]  Masakazu Kojima,et al.  Exploiting sparsity in primal-dual interior-point methods for semidefinite programming , 1997, Math. Program..

[15]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[16]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[17]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

[18]  Hans van Maaren,et al.  Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights , 2004, Annals of Mathematics and Artificial Intelligence.

[19]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[20]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[21]  Russell Impagliazzo,et al.  Upper and lower bounds for tree-like cutting planes proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[22]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[23]  Hans van Maaren,et al.  Elliptic Approximations of Propositional Formulae , 1999, Discret. Appl. Math..

[24]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[25]  Hans van Maaren.  On the use of second order derivatives for the satisfiability problem , 1996, Satisfiability Problem: Theory and Applications.

[26]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[27]  Panos M. Pardalos,et al.  Satisfiability Problem: Theory and Applications , 1997 .

[28]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[29]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[30]  Farid Alizadeh,et al.  Combinatorial Optimization with Semi-Definite Matrices , 1992, IPCO.

[31]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[32]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[33]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[34]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[35]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.