A logical approach to efficient Max-SAT solving

Artificial Intelligence

Volumn 172, Issue 2-3, 2008, Pages 204-233

  Larrosa, Javier ^a   Heras, Federico ^a   de Givry, Simon ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CEMAGREF   (France)

Author keywords

Inference; Max SAT; Search

Indexed keywords

ALGORITHMS; BENCHMARKING; OPTIMIZATION; PROBLEM SOLVING;

DPLL-LIKE ALGORITHM; LOWER BOUNDS; MAX-SAT; SEARCH ALGORITHM;

COMPUTATIONAL COMPLEXITY;

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

References (53)

1. J. Larrosa, F. Heras, Resolution in Max-SAT and its relation to local consistency for weighted CSPs, in: Proc. of the 19th IJCAI, Edinburgh, UK, 2005, pp. 193-198
2. J. Larrosa, F. Heras, New Inference Rules for Efficient Max-SAT Solving, in: Proc. of AAAI-06, Boston, MA, 2006
3. H. Xu, R. Rutenbar, K. Sakallah, sub-SAT: A formulation for relaxed boolean satisfiability with applications in routing, in: Proc. Int. Symp. on Physical Design, San Diego CA, 2002, pp. 182-187
4. Strickland D., Barnes E., and Sokol J. Optimal protein structure alignment using maximum cliques. Operations Research 53 3 (2005) 389-402
5. Vasquez M., and Hao J. A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Journal of Computational Optimization and Applications 20 2 (2001) 137-157
6. J.D. Park, Using weighted MAX-SAT engines to solve MPE, in: Proc. of AAAI-02, Edmonton, Alberta, Canada, 2002, pp. 682-687
7. T. Sandholm, An algorithm for optimal winner determination in combinatorial auctions, in: Proc. of the 16th IJCAI, 1999, pp. 542-547
8. N. Bansal, V. Raman, Upper Bounds for MaxSat: Further improved, in: ISAAC, 1999, pp. 247-258
9. Niedermeier R., and Rossmanith P. New upper bounds for maximum satisfiability. J. Algorithms 36 1 (2000) 63-88
10. J. Chen, I. Kanj, Improved exact algorithms for Max-SAT, in: Proc. of the 5th Latin American Symposium on Theoretical Informatics, 2002, pp. 341-355
11. S. de Givry, J. Larrosa, P. Meseguer, T. Schiex, Solving Max-SAT as weighted CSP, in: Proc. of CP-03, Cork, Ireland, 2003, pp. 363-376
12. H. Shen, H. Zhang, Study of lower bounds for Max-2-SAT, in: Proc. of AAAI-04, San Jose, CA, 2004, pp. 185-190
13. Xing Z., and Zhang W. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164 1-2 (2005) 47-80
14. T. Alsinet, F. Manya, J. Planes, Improved exact solver for weighted Max-SAT, in: Proc. of SAT-05, St Andrews, Scotland, 2005, pp. 371-377
15. R. Nieuwenhuis, A. Oliveras, On SAT modulo theories and optimization problems, in: Proc. of SAT-06, Seattle, WA, 2006, pp. 156-169
16. Bertele U., and Brioschi F. Nonserial Dynamic Programming (1972), Academic Press, New York
17. Dechter R. Constraint Processing (2003), Morgan Kaufmann, San Francisco, CA
18. Rish I., and Dechter R. Resolution vs. inference: Two approaches to SAT. Journal of Automated Reasoning 24 1 (2000) 225-275
19. Arnborg S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey. BIT 25 (1985) 2-23
20. Davis M., Logemann G., and Loveland G. A machine program for theorem proving. Communications of the ACM 5 (1962) 394-397
21. Davis M., and Putnam H. A computing procedure for quantification theory. Journal of the ACM 3 (1960)
22. Gelder A.V. Satisfiability testing with more reasoning and less guessing. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge (1995), American Mathematical Society, Providence, RI pp. 0-1
23. F. Bacchus, Enhancing Davis Putnam with extended binary clause reasoning, in: Proc. of AAAI-02, Edmonton, Alberta, Canada, 2002, pp. 613-619
24. L. Drake, A. Frisch, T. Walsh, Adding resolution to the DPLL procedure for Boolean satisfiability, in: Proc. of SAT-02, Cincinnati, OH, 2002, pp. 122-129
25. Papadimitriou C. Computational Complexity (1994), Addison-Wesley, Reading, MA
26. T. Schiex, Arc Consistency for soft constraints, in: Proc. of CP-00, Singapore, 2000, pp. 411-424
27. M. Bonet, J. Levy, F. Manya, A complete calculus for Max-SAT, in: Proc. of SAT-06, Seattle, WA, 2006, pp. 240-251
28. B. Cha, K. Iwama, Adding new clauses for faster local search, in: Proc. of AAAI-96, Portland, OR, 1996, pp. 332-337
29. R. Wallace, E. Freuder, Comparative studies of constraint satisfaction and Davis-Putnam algorithms for Max-SAT problems, in: Cliques, Coloring and Satisfiability, 1996, pp. 587-615
30. T. Alsinet, F. Manya, J. Planes, Improved branch and bound algorithms for Max-SAT, in: Proc. of SAT-03, Portofino, Italy, 2003, pp. 408-415
31. Bessière C. Arc-consistency and arc-consistency again. Artificial Intelligence 65 1 (1994) 179-190
32. S. de Givry, F. Heras, J. Larrosa, M. Zytnicki, Existential arc consistency: getting closer to full arc consistency in weighted CSPs, in: Proc. of the 19th IJCAI, Edinburgh, UK, 2005, pp. 84-89
33. C.M. Li, F. Manya, J. Planes, Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers, in: Proc. of CP-05, Sitges, Spain, 2005, pp. 403-414
34. C.-M. Li, F. Manyà, J. Planes, New inference rules for Max-SAT, Journal of Artificial Intelligence Research, in press
35. Sheini H.M., and Sakallah K.A. Pueblo: A hybrid pseudo-Boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 165-189
36. N. Eén, N. Sörensson, An Extensible SAT-solver, in: Proc. of SAT-03, Portofino, Italy, 2003, pp. 502-518
37. Johnson D.S., and Trick M. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1993), AMS
38. J.-C. Régin, Using constraint programming to solve the maximum clique problem, in: Proc. of CP-03, Cork, Ireland, 2003, pp. 634-648
39. Wood D. An algorithm for finding maximum cliques in a graph. Operations Research Letters 21 (1997) 211-217
40. Ostergard P.R.J. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120 (2002) 197-207
41. T. Fahle, Simple and fast: Improving a branch-and-bound algorithm for maximum clique, in: Proc. of ESA, 2002, pp. 485-498
42. Leyton-Brown K., Pearson M., and Shoham Y. Towards a universal test suite for combinatorial auction algorithms. ACM E-Commerce (2000) 66-76
43. Meseguer P., Rossi F., and Schiex T. Soft constraints. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier, Amsterdam (Ch. 9)
44. Larrosa J., and Schiex T. Solving weighted CSP by maintaining arc-consistency. Artificial Intelligence 159 1-2 (2004) 1-26
45. Dechter R. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 1-2 (1999) 41-85
46. Larrosa J., and Dechter R. Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints 8 3 (2003) 303-326
47. Larrosa J., Morancho E., and Niso D. On the practical applicability of Bucket Elimination: Still-life as a case study. Journal of Artificial Intelligence Research 23 (2005) 421-440
48. J. Larrosa, Node and arc consistency in weighted CSP, in: Proc. of AAAI-02, Edmonton, Alberta, Canada, 2002, pp. 48-53
49. Cooper M. High-order consistency in valued constraint satisfaction. Constraints 10 3 (2005) 283-305
50. E. Freuder, C. Elfe, Neighborhood inverse consistency preprocessing, in: Proc. of AAAI-96, Portland, OR, 1996, pp. 202-208
51. C.-M. Li, F. Manyà, J. Planes, Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT, in: Proc. of AAAI-06, Boston, MA, 2006
52. C.M. Li, Anbulagan, Heuristics based on unit propagation for satisfiability problems, in: Proc. of the 15th IJCAI, Nagoya, Japan, 1997, pp. 366-371
53. Eén N., and Sörensson N. Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 1-26