MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability

Artificial Intelligence

Volumn 164, Issue 1-2, 2005, Pages 47-80

  Xing, Zhao ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

DPLL; Linear programming; Nonlinear programming; Unit propagation; Variable ordering; Weighted maximum satisfiability

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

DAVIS-PUTNAM-LOGEMANN-LOVELAND PROCEDURE (DPLL); UNIT PROPAGATION; VARIABLE ORDERING; WEIGHTED MAXIMUM SATISFIABILITY;

ALGORITHMS;

EID: 16244363360     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.01.004     Document Type: Article

References (47)

1. F. Aloul, A. Ramani, I. Markov, and K. Sakallah Generic ILP versus specialized 0-1 ILP: an update International Conference on Computer Aided Design (ICCAD) 2002
2. T. Alsinet, F. Manya, and J. Planes Improved branch and bound algorithms for Max-SAT Proceedings of SAT2003 2003
3. C.E. Blair, R.G. Jeroslow, and J.K. Lowe Some results and experiments in programming techniques for prepositional logic Comput. Oper. Res. 13 5 1986 633 645
4. B. Borchchers, and J. Furman A two-phase exact algorithm for Max-SAT and weighted Max-SAT problems J. Combin. Optim. 2 4 1999 299 306
5. http://www.nmt.edu/~borchers/maxsat.html
6. S. Cook The complexity of theorem-proving procedures Proceedings of the 3rd ACM Symposium on the Theory of Computing 1971 151 158
7. D. Coppersmith, D. Gamarnik, M. Hajiaghayi, and G.B. Sorkin Random MAX SAT, random MAX CUT, and their phase transitions Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms 2003 364 373
8. J.M. Crawford, and L.D. Auton Experimental results on the crossover point in satisfiability problems Proceedings of AAAI-93, Washington, DC 1993 21 27
9. G.B. Dantzig, and M.N. Thapa Linear Programming 1: Introduction 1997 Springer New York
10. M. Davis, G. Logemann, and D. Loveland A machine program for theorem proving C. ACM 5 1962 394 397
11. M. Davis, and H. Putnam A computing procedure for quantification theory J. ACM 7 1960 201 215
12. H. Dixon, and M.L. Ginsberg Inference methods for a pseudo-boolean satisfiability solver Proceedings of AAAI-02, Edmonton, AB 2002 635 640
13. J.W. Freeman, Improvements to propositional satisfiability search algorithms, PhD thesis, Univ. of Pennsylvania, 1995
14. E.C. Freuder, and R.J. Wallace Partial constraint satisfaction Artificial Intelligence 58 1992 21 70
15. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 Freeman New York
16. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin, and M.H. Wright On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method Math. Programming 26 1986 183 209
17. S.D. Givry, J. Larrosa, P. Meseguer, and T. Schiex Solving Max-SAT as weighted CSP Proceedings of 9th International Conference on Principles and Practice of Constraint Programming (CP2003) 2003 363 376
18. P.L. Hammer, P. Hansen, and B. Simeone Roof duality, complementation and persistency in quadratic 0-1 optimization Math. Programming 28 1984 121 155
19. P.L. Hammer, and S. Rudeanu Boolean Methods in Operations Research and Related Areas 1968 Springer Berlin
20. P. Hansen, and B. Jaumard Algorithm for the maximum satisfiability problem Computing 44 1990 279 303
21. F.S. Hillier, and G.J. Lieberman Introduction to Operations Research 2001 McGraw-Hill New York
22. J.N. Hooker Input proofs and rank one cutting-planes ORSA J. Comput 1 1989 137 145
23. J.N. Hooker, and G. Fedjki Branch-and-cut solution of inference problems in prepositional logic Ann. Math. Artificial Intelligence 1 1990 123 139
24. J.N. Hooker, and V. Vinay Branching rules for satisfiability J. Automated Reasoning 15 1995 359 383
25. H.H. Hoos, and T. Stuzle http://www.satlib.org 1999
26. http://www.ilog.com/products/cplex
27. D.S. Johnson Approximation algorithms for combinatorial problems J. Comput. System Sci. 9 1974 256 278
28. S. Joy, J. Mitchell, and B. Borchers A branch and cut algorithm for Max-SAT and weighted Max-SAT D. Du J. Gu P.M. Pardalos Satisfiability Problem: Theory and Applications 1997 519 536
29. R. Karp Reducibility among combinatorial problems R. Miller J. Thatcher Complexity of Computer Computations 1992 Plenum Press New York 85 103
30. C.M. Li, and Anbulagan Heuristics based on unit propagation for satisfiability problems Proceedings of IJCAI-97, Nagoya, Japan 1997 366 371
31. C.L. Liu Introduction to Combinatorial Mathematics 1968 McGraw-Hill New York
32. D. McAllester, B. Selman, and H. Kautz Evidence for invariants in local search Proceedings of AAAI-97, Providence, RI 1997 321 326
33. D.B. Mitchell, B. Selman, and H. Levesque Hare and easy distributions of SAT problems Proceedings of AAAI-93, Washington, DC 1993 459 465
34. M. Moskewics, C. Madigan, Y. Zhao, L. Zhang, and S. Malik Chaff: engineering an efficient SAT solver Proceedings of the Design Automation Conference 2001
35. R. Niedermeier, and P. Rossmanith New upper bounds for maximum satisfiability J. Algorithm 36 2000 63 88
36. J.D. Park Using weighted MAX-SAT engines to solve MPE Proceedings of AAAI-02, Edmonton, AB 2002 682 687
37. B. Selman, Mwff: Program for generating random max k-SAT instances, Available from DIMACS
38. B. Selman, H. Kautz, and B. Cohen Noise strategies for local search Proceedings of AAAI-94, Seattle, WA 1994 337 343
39. H. Shen, and H. Zhang Study of lower bound functions for Max-2-SAT Proceedings of AAAI-02, Edmonton, AB 2002 185 190
40. H. Shen, and H. Zhang An empirical study of Max-2-SAT phase transitions Proceedings of LICS Workshop on Phase Transitions 2003
41. D.A. Spielman, and S. Teng Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time J. ACM 51 1 2004 385 463
42. R.J. Wallace Enhancing maximum satisfiability algorithms with pure literal strategies 11th Canadian Conf. on AI 1996
43. R.J. Wallace, and E.C. Freuder Comparative study of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems D. Johnson M. Trick Cliques, Coloring, and Satisfiability 1996 587 615
44. J.P. Walser Integer Optimization Local Search 1999 Springer Berlin
45. Z. Xing, and W. Zhang Efficient strategies for (weighted) maximum satisfiability Proceedings of 10th International Conference on Principles and Practice of Constraint Programming (CP2004) 2004 690 705
46. H. Zhang, H. Shen, and F. Manya Exact algorithms for Max-SAT Workshop on First-Order Theorem Proving (FTP-03) 2003
47. W. Zhang Phase transitions and backbones of 3-SAT and maximum 3-SAT Proceedings of 7th International Conference on Principles and Practice of Constraint Programming (CP2001) 2001 155 167