Efficient strategies for (weighted) maximum satisfiability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 690-705

  Xing, Zhao ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORMAL LOGIC; LINEAR PROGRAMMING;

DAVIS-PUTNAM-LOGEMANN-LOVELAND; DYNAMIC VARIABLE ORDERING; EFFICIENT STRATEGY; MAXIMUM SATISFIABILITY; ORDERS OF MAGNITUDE; RANDOM PROBLEM; SATISFIABILITY; UNIT PROPAGATION;

HEURISTIC PROGRAMMING;

EID: 33646192504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_50     Document Type: Article

References (25)

1. T. Alsinet, F. Manya, and J. Planes. Improved branch and bound algorithms for Max-SAT. In Proc. SAT2003, 2003.
2. B. Borchers and J. Furman. A two-phase exact algorithm for Max-SAT and weighted Max-SAT problems. J. Combinatorial Optimization, 2(4):299-306, 1999.
3. http://www.nmt.edu/borchers/maxsat.html.
4. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. CACM, 5:394-397, 1962.
5. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
6. H. Dixon and M. L. Ginsberg. Inference methods for a pseudo-boolean satisfiability solver. In Proc. AAAI-02, pages 635-640.
7. J. W. Freeman. Improvements to Prepositional Satisfiability Search Algorithms. PhD thesis, Univ. of Pennsylvania, 1995.
8. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21-70, 1992.
9. S.d. Givry, J. Larrosa, P. Meseguer, and T. Schiex. Solving Max-SAT as weighted CSP. In Proc. CP-2003, 2003.
10. P. Hansen and B. Jaumard. Algorithm for the maximum satisfiability problem. Computing, 44:279-303, 1990.
11. F. S. Hillier and G. J. Lieberman. Introduction to Operations Research. McGraw-Hill, 2001.
12. J. N. Hooker and G. Fedjki. Branch-and-cut solution of inference problems in prepositional logic. Annals of Math, and Artificial Intelligence, 1:123-139, 1990.
13. J.N. Hooker and V. Vinay. Branching rules for satisfiability. J. Automated Reasoning, 15:359-383, 1995.
14. H.H. Hoos and T. Stuzle. http://www.satlib.org, 1999.
15. S. Joy, J. Mitchell, and B. Borchers. A branch and cut algorithm for Max-SAT and weighted Max-SAT. In D. Du, J. Gu, and P.M. Pardalos, editors, Satisfiability Problem: Theory and Applications, pages 519-536, 1997.
16. C.M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI-97, pages 366-371.
17. C.L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968.
18. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. J. Algorithm, 36:63-88, 2000.
19. James D. Park. Using weighted max-sat engines to solve mpe. In Proc. AAAI-02, pages 682-687.
20. B. Selman. Mwff: Program for generating random max k-SAT instances. Available from DIMACS.
21. B. Selman, H. Kautz, and B. Cohen. Noise strategies for local search. In Proc. AAAI-94, pages 337-343, 1994.
22. R. J. Wallace. Enhancing maximum satisfiability algorithms with pure literal strategies. In 11th Canadian Conf. on AI, 1996.
23. R.J. Wallace and E.C. Freuder. Comparative study of constraint satisfaction and davis-putnam algorithms for maximum satisfiability problems. In D. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability, pages 587-615. 1996.
24. J.P. Walser. Integer Optimization Local Search. Springer, 1999.
25. H. Zhang, H. Shen, and F. Manya. Exact algorithms for Max-SAT. In Workshop on First-Order Theorem Proving (FTP-03).