Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based relaxations with LP relaxations for MAX-2-SAT. We will show how SDP relaxations are surprisingly powerful, providing much tighter bounds than LP relaxations, across different constrainedness regions. SDP relaxations can also be computed very efficiently, thus quickly providing tight lower and upper bounds on the optimal solution. We also show the effectiveness of SDP relaxations in providing heuristic guidance for iterative variable setting, significantly more accurate than the guidance based on LP relaxations. SDP allows us to set up to around 80% of the variables without degrading the optimal solution, while setting a single variable based on the LP relaxation generally degrades the global optimal solution in the overconstrained area. Our results therefore show that SDP relaxations may further boost exact MAX-SAT solvers.


Boolean Variable Conjunctive Normal Form Linear Program Relaxation Unit Clause Integer Quadratic Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hooker, J.N., Fedjiki, C.: Branch-and-cut solution of inference problems in propositional logic. Annals of Math. and Artificial Intelligence 1 (1990)Google Scholar
  2. 2.
    Warners, J.: Nonlinear approaches to satisfiability problems. PhD thesis, Technische Universiteit Eindhoven (1999)Google Scholar
  3. 3.
    Xing, Z., Zhang, W.: Maxsolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164(1-2), 47–80 (2005)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Joy, S., Mitchell, J., Borchers, B.: A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. Satisfiability Problem: Theory and Applications 35, 519–536 (1997)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization 5(1), 13–51 (1995)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Goemans, M., Rendl, F.: Combinatorial Optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, pp. 343–360. Kluwer, Dordrecht (2000)CrossRefGoogle Scholar
  7. 7.
    Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)CrossRefMATHGoogle Scholar
  8. 8.
    Goemans, M., Williamson, D.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM 42(6), 1115–1145 (1995)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Hochbaum, D.S.: (Editor) Approximation algorithms for NP-Hard problems. PWS Publishing Company (1997)Google Scholar
  10. 10.
    Feige, U., Goemans, M.: Approximating the value of two prover proof systems, with applications to max2sat and max dicut. In: Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (1995)Google Scholar
  11. 11.
    Garey, M., Johnson, D.: Computers and Intractibility. Freeman, New York (1979)Google Scholar
  12. 12.
    Chvátal, V., Reed, B.: Mike gets some (the odds are on his side). In: 33th Annual Symposium of Foundations of Computer Science, pp. 620–627 (1992)Google Scholar
  13. 13.
    Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 67–82. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Anjos, M.: Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems. Journal on Satisfiability, Boolean Modeling and Computation 1, 1–47 (2005)MATHGoogle Scholar
  15. 15.
    de Klerk, E., van Maaren, H.: On semidefinite programming relaxation of 2+p-sat. Annals of Math. and Artificial Intelligence 37 (2003)Google Scholar
  16. 16.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)CrossRefMATHGoogle Scholar
  17. 17.
    Selman, B.: Mwff - a program for generating random MAX k-SAT instances (1993)Google Scholar
  18. 18.
    Borchers, B.: A C Library for Semidefinite Programming. Optimization Methods and Software 11(1), 613–623 (1999), MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Carla P. Gomes
    • 1
  • Willem-Jan van Hoeve
    • 1
  • Lucian Leahu
    • 1
  1. 1.Dpt. of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations