Relaxations of the Satisfiability Problem Using Semidefinite Programming

  • Authors:

  • Etienne De Klerk;Hans Van Maaren;Joost P. Warners

  • Affiliations:

  • Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands. e-mail: e ...;Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands. e-mail: h ...;Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands, and SEN2, CWI, P. ...

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.