Abstract.
This paper is concerned with the analysis and comparison of semidefinite programming (SDP) relaxations for the satisfiability (SAT) problem. Our presentation is focussed on the special case of 3-SAT, but the ideas presented can in principle be extended to any instance of SAT specified by a set of boolean variables and a propositional formula in conjunctive normal form. We propose a new SDP relaxation for 3-SAT and prove some of its theoretical properties. We also show that, together with two SDP relaxations previously proposed in the literature, the new relaxation completes a trio of linearly sized relaxations with increasing rank-based guarantees for proving satisfiability. A comparison of the relative practical performances of the SDP relaxations shows that, among these three relaxations, the new relaxation provides the best tradeoff between theoretical strength and practical performance within an enumerative algorithm.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Acknowledgments.
The author thanks Franz Rendl, Monique Laurent, and Etienne de Klerk for several helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received: June 2003/ Final version received: March 2004
Rights and permissions
About this article
Cite this article
Anjos, M. On semidefinite programming relaxations for the satisfiability problem. Math Meth Oper Res 60, 349–367 (2004). https://doi.org/10.1007/s001860400377
Issue Date:
DOI: https://doi.org/10.1007/s001860400377