Solving satisfiability problems using elliptic approximations - Effective branching rules

Discrete Applied Mathematics

Volumn 107, Issue 1-3, 2000, Pages 241-259

  Warners, Joost P ^a,b   Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042851687     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00249-3     Document Type: Article

References (20)

1. Böhm M., Speckenmeyer E. A fast parallel SAT-solver - efficient workload balancing. Ann. Math. Artificial Intelligence. 17:1996;381-400.
2. S.A. Cook, The complexity of theorem proving procedures, Proceedings of the Third Annual ACM Symposium on the Theory of Computing, 1971, pp. 151-158.
3. Davis M., Logemann M., Loveland D. A machine program for theorem proving. Comm. ACM. 5:1962;394-397.
4. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;210-215.
5. O. Dubois, P. Andre, Y. Boufkhad, J. Carlier, SAT versus UNSAT, in: Johnson and Trick [10] , pp. 415-436.
6. A. Van Gelder, Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, in: Johnson and Trick [10] , pp. 559-586.
7. Gu J. Global optimization for satisfiability (SAT) problem. IEEE Trans. Knowledge Data Eng. 6(3):1994;361-381.
8. Hooker J.N., Vinay V. Branching rules for satisfiability. J. Automated Reasoning. 15(3):1195;359-383.
9. Jeroslow R.G., Wang J. Solving propositional satisfiability problems. Ann. Math. Artificial Intelligence. 1:1990;167-187.
10. Johnson D.S., Trick (Eds.) M.A. Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 26. 1996;American Mathematical Society, Providence, RI.
11. Kamath A.P., Karmarkar N.K., Ramakrishnan K.G., Resende M.G.C. Computational experience with an interior point algorithm on the satisfiability problem. Ann. Oper. Res. 25:1990;43-58.
12. H. Van Maaren, Elliptic approximations of propositional formulae, Discrete Appl. Math. 96-97 (1999) 223-244.
13. Van Maaren H. On the use of second-order derivatives for the satisfiability problem. Du D., Gu J., Pardalos P.M. Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35. 1997;677-687 American Mathematical Society, Providence, RI.
14. Van Maaren H., Warners J.P. Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. Disc. Appl. Math. 107:2000;225-239.
15. H. Van Maaren, J.P. Warners, 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.
16. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, 1992, pp. 459-465.
17. G. Strang, Linear Algebra and its Applications, 3rd Edition, Harcourt Brace Jovanovich, 1988.
18. Warners J.P. A nonlinear approach to a class of combinatorial optimization problems. Statist. Neerlandica. 52(2):1998;162-184.
19. Warners J.P., Van Maaren H. Recognition of tractable satisfiability problems through balanced polynomial representations. Discrete Appl. Math. 99:2000;224-244.
20. Warners J.P., Terlaky T., Roos C., Jansen B. A potential reduction approach to the frequency assignment problem. Discrete Appl. Math. 78(1-3):1997;251-282.