Relaxations of the satisfiability problem using semidefinite programming

Journal of Automated Reasoning

Volumn 24, Issue 1-2, 2000, Pages 37-65

  De Klerk, Etienne ^a   Van Maaren, Hans ^a   Warners, Joost P ^a,b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Relaxation; Satisfiability problem; Semidefinite programming

Indexed keywords

EID: 0344794583     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1006362203438     Document Type: Article

References (37)

1. Alizadeh, F.: Combinatorial optimization with interior point methods and semi-definite matrices, Ph.D. Thesis, University of Minnesota, Minneapolis, 1991.
2. Aspvall, B., Plass, M. F., and Tarjan, R. E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett. 8(3) (1979), 121-123.
3. Benson, S. J., Ye, Y., and Zhang, X.: Solving large-scale sparse semidefinite programs for combinatorial optimization, Technical Report, Computational Optimization Lab., Department of Management Science, University of Iowa, Iowa City, 1997.
4. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math. 4 (1973), 305-337.
5. Cook, S.A.: The complexity of theorem proving procedures, in Proceedings of the 3rd annual ACM symposium on the Theory of Computing, 1971, pp. 151-158.
6. Cook, W., Coullard, C. R., and Turan, G.: On the complexity of cutting plane proofs, Discrete Appl. Math. 18 (1987), 25-38.
7. Davis, M., Logemann, M., and Loveland, D.: A machine program for theorem proving, Comm. ACM 5 (1962), 394-397.
8. de Klerk, E.: Interior point methods for semidefinite programming, Ph.D. Thesis, Delft University of Technology, Delft, The Netherlands, 1997.
9. de Klerk, E., Pasechnik, D. V., and Warners, J. P.: Approximate graph colouring algorithms based on the v-function, Technical Report, 1999. In preparation.
10. de Klerk, E. and Warners, J. P.: Semidefinite programming techniques for MAX-2-SAT and MAX-3-SAT: Computational perspectives, Technical Report 98-34, Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands, 1998.
11. Du, D., Gu, J., and Pardalos, P. M. (eds.): Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Math, and Comput. Sci. 35, Amer. Math. Soc., 1997.
12. Feige, U. and Goemans, M.: Approximating the value of two prover proof systems with applications to MAX 2SAT and MAX DICUT, in Proc. Third Israel Symposium on Theory of Computing and Systems, 1995, pp. 182-189.
13. Goemans, M. X. and Williamson, D. P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42(6) (1995), 1115-1145.
14. Gu, J., Purdom, P. W., Franco, J., and Wah, B. W.: Algorithms for the satisfiability (SAT) problem: A survey, in Du et al. [11], pp. 9-151.
15. Haken, A.: The intractability of resolution, Theoret. Comput. Sci. 39 (1985), 297-308.
16. Helmberg, C. and Rendl, F.: A spectral bundle method for SDP, Technical Report ZIB, Preprint SC-97-37, Konrad-Zuse-Zentrum, Berlin, 1997.
17. Hooker, J. N.: Resolution vs. cutting plane solution of inference problems: some computational experience, Oper. Res. Lett. 7(1) (1988), 1-7.
18. Horn, R. A. and Johnson, C. R.: Matrix Analysis, Cambridge University Press, 1985.
19. Impagliazzo, R., Pitassi, T., and Urquhart, A.: Upper and lower bounds for treelike cutting plane proofs, in Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science, 1994, pp. 220-228.
20. Karloff, H. and Zwick, U.: A 7/8-approximation algorithm for MAX3SAT? in Proceedings of the 38th Symposium on the Foundations of Computer Science, 1997, pp. 406-415.
21. Kullmann, O.: Investigations on autark assignments, Technical Report, Johann Wolfgang Goethe-Universität, Fachbereich Mathematik, 60054 Frankfurt, Germany, 1998. Submitted.
22. Lovász, L.: On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25 (1979), 1-7.
23. Lovász, L. and Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim. 1(2) (1991), 166-190.
24. Van Maaren, H.: Elliptic approximations of prepositional formulae, Technical Report 96-65, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands, 1996. To appear in Discrete Appl. Math.
25. Van Maaren, H.: On the use of second order derivatives for the satisfiability problem, in Du et al. [11], pp. 677-687.
26. Van Maaren, H. and Warners, J. P.: Solving satisfiability problems using elliptic approximations - a note on volumes and weights, Technical Report 98-32, Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands, 1998.
27. n steps, Discrete Appl. Math. 10 (1985), 287-295.
28. Schaefer, T. J.: The complexity of satisfiability problems, in Proceedings of the Tenth Symposium on the Theory of Computing, 1978, pp. 216-226.
29. Sherali, H. D. and Adams, W. P.: A hierarchy of relaxations between the continuous and convex hull representations for 0-1 programming problems, SIAM J. Discrete Math. 3(3) (1990), 411-430.
30. Strang, G.: Linear Algebra and Its Applications, 3rd edn, Harcourt Brace Jovanovich, 1988.
31. Sturm, J. F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Technical Report, Communications Research Laboratory, McMaster University, Hamilton, Canada, 1998.
32. Trevisan, L., Sorkin, G., Sudan, M., and Williamson, D.: Gadgets, approximation and linear programming, in Proceedings of the 37th Symposium on the Foundations of Computer Science, 1996, pp. 617-626.
33. Urquhart, A.: Open Problem Posed at SAT'98, Paderborn, Germany, 1998.
34. Vandenberghe, L. and Boyd, S.: Semidefinite programming, SIAM Rev. 38 (1996), 49-95.
35. Warners, J. P. and Van Maaren, H.: Recognition of tractable satisfiability problems through balanced polynomial representations, Discrete Appl. Math., 1999. To appear.
36. Warners, J. P. and Van Maaren, H.: Solving satisfiability problems using elliptic approximations - effective branching rules, Technical Report 98-18, Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands, 1998. Accepted for publication in Discrete Appl. Math.
37. Warners, J. P. and Van Maaren, H.: A two-phase algorithm for solving a class of hard satisfiability problems, Oper. Res. Lett. 23(3-5) (1999), 81-88.