MaxSAT, hard and soft constraints

Frontiers in Artificial Intelligence and Applications

Volumn 185, Issue 1, 2009, Pages 613-631

  Li, Chu Min ^a   Manyà, Felip ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

APPLICATION OF SATISFIABILITY; BRANCH AND BOUNDS; CHALLENGE PROBLEMS; COMBINATORIAL OPTIMIZATION PROBLEMS; GENERIC APPROACH; HARD AND SOFT CONSTRAINTS; INFERENCE RULES; LOW BOUND; SATISFIABILITY TESTING; VARIABLES SELECTIONS;

COMBINATORIAL OPTIMIZATION;

EID: 72949102660     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-929-5-613     Document Type: Article

References (47)

1. J. Argelich, A. Cabiscol, I. Lynce, and F. Manỳa. Modelling Max-CSP as partial Max-SAT. In Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT-2008, Guangzhou, China, pages 1-14. Springer LNCS 4996, 2008.
2. J. Argelich, C. M. Li, F. Manỳa, and J. Planes. The first and second Max-SAT evaluations. Journal on Satisfiability, Boolean Modeling and Computation, 4, 2008.
3. J. Argelich and F. Manỳa. Exact Max-SAT solvers for overconstrained problems. Journal of Heuristics, 12(4-5):375-392, 2006.
4. J. Argelich and F. Manỳa. Learning hard constraints in Max-SAT. In Proceedings of the Workshop on Constraint Solving and Constraint Logic Porgramming, CSCLP-2006, Lisbon, Portugal, pages 1-12, 2006.
5. J. Argelich and F. Manỳa. Partial Max-SAT solvers with clause learning. In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, SAT-2007, Lisbon, Portugal, pages 28-40. Springer LNCS 4501, 2007.
6. T. Alsinet, F. Manỳa, and J. Planes. Improved branch and bound algorithms for Max-SAT. In Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing, 2003.
7. T. Alsinet, F. Manỳa, and J. Planes. A Max-SAT solver with lazy data structures. In Proceedings of the 9th Ibero-American Conference on Artificial Intelligence, IBERAMIA 2004, Puebla, Ḿexico, pages 334-342. Springer LNCS 3315, 2004.
8. T. Alsinet, F. Manỳa, and J. Planes. Improved exact solver for weighted Max-SAT. In Proceedings of the 8th International Confer ence on Theory and Applications of Satisfiability Testing, SAT-2005, St. Andrews, Scotland, pages 371-377. Springer LNCS 3569, 2005.
9. T. Alsinet, F. Manỳa, and J. Planes. An efficient solver for Weighted Max-SAT. Journal of Global Optimization, 41:61-73, 2008.
10. M. F. Anjos. Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems. Journal on Satisfiability, Boolean Modeling and Computation, 1:1-47, 2005.
11. B. Borchers and J. Furman. A two-phase exact algorithm for MAXSAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization, 2:299-306, 1999.
12. M. L. Bonet, J. Levy, and F. Manỳa. A complete calculus for Max-SAT. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT-2006, Seattle, USA, pages 240-251. Springer LNCS 4121, 2006.
13. M. L. Bonet, J. Levy, and F. Manỳa. Resolution for Max-SAT. Artificial Intelligence, 171(8-9):240-251, 2007.
14. N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. In Proc 10th International Symposium on Algorithms and Computation, ISAAC'99, Chennai, India, pages 247-260. Springer, LNCS 1741, 1999.
15. S. Darras, G. Dequen, L. Devendeville, and C. M. Li. On inconsistent clause-subsets for max-sat solving. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP-2007, Providence/RI, USA, pages 225-240. Springer LNCS 4741, 2007.
16. S. De Givry, J. Larrosa, P. Meseguer, and T. Schiex. Solving Max-SAT as weighted CSP. In 9th International Conference on Principles and Practice of Constraint Programming, CP-2003, Kinsale, Ireland, pages 363-376. Springer LNCS 2833, 2003.
17. Z. Fu and S. Malik. On solving the partial MAX-SAT problem. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT-2006, Seattle, USA, pages 252-265. Springer LNCS 4121, 2006.
18. C. P. Gomes, W.-J. van Hoeve, and L. Leahu. The power of semidefinite programming relaxations for MAXSAT. In Proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR06, Cork, Ireland, pages 104-118. Springer LNCS 3990, 2006.
19. M. X. Goemans and D. P. Williamson. .878-approximation algorithms for MAX CUT and MAX 2SAT. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 422-431, 1994.
20. M. X. Goemans and D. P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal of Discrete Mathematics, 7:656-666, 1994.
21. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidef inite programming. Journal of the ACM, 42:1115-1145, 1995.
22. J. Hastad. Some optimal inapproximability results. In Proceedings of the 28th ACM Symposium on the Theory of Computing, pages 1-10, 1997.
23. F. Heras and J. Larrosa. New inference rules for efficient Max-SAT solving. In Proceedings of the National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA, pages 68-73, 2006.
24. F. Heras, J. Larrosa, and A. Oliveras. MiniMaxSat: A new weighted Max-SAT solver. In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, SAT-2007, Lisbon, Portugal, pages 41-55, 2007.
25. F. Heras, J. Larrosa, and A. Oliveras. MiniMaxSAT: An efficient weighted Max-SAT solver. Journal of Artificial Intelligence Research, 31:1-32, 2008.
26. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
27. H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX3SAT? In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97, pages 406-415, 1997.
28. J. Larrosa and F. Heras. Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI-2005, Edinburgh, Scotland, pages 193-198. Morgan Kaufmann, 2005.
29. J. Larrosa, F. Heras, and S. de Givry. A logical approach to efficient Max-SAT solving. Artificial Intelligence, 172(2-3):204-233, 2008.
30. C. M. Li, F. Manỳa, N. O. Mohamedou, and J. Planes. Transforming inconsistent subformulas in MaxSAT lower bound computation. In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming, CP-2008, Sydney, Australia. Springer LNCS, 2008.
31. C. M. Li, F. Manỳa, and J. Planes. Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, pages 403-414. Springer LNCS 3709, 2005.
32. C. M. Li, F. Manỳa, and J. Planes. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In Proceedings of the 21st National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA, pages 86-91, 2006.
33. C. M. Li, F. Manỳa, and J. Planes. New inference rules for Max-SAT. Journal of Artificial Intelligence Research, 30:321-359, 2007.
34. H. Lin and K. Su. Exploiting inference rules to compute lower bounds for MAX-SAT solving. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI-2007, Hyderabad, India, pages 2334-2339, 2007.
35. H. Lin, K. Su, and C. M. Li. Within-problem learning for efficient lower bound computation in Max-SAT solving. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence, AAAI-2008, Chicago/IL, USA, pages 351-356, 2008.
36. J. P. Marques-Silva and V. M. Manquinho. Towards more effective unsatisfiability-based maximum satisfiability algorithms. In Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT-2008, Guangzhou, China, pages 225-230. Springer LNCS 4996, 2008.
37. J. P. Marques-Silva and J. Planes. Algorithms for Maximum Satisfiability using Unsatisfiable Cores. In Proceedings of Design, Automation and Test in Europe (DATE 08), 2008.
38. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36:63-88, 2000.
39. K. Pipatsrisawat and A. Darwiche. Clone: Solving weighted Max-SAT in a reduced search space. In 20th Australian Joint Conference on Artificial Intelligence, AI-07, Qeensland, Australia, pages 223-233, 2007.
40. K. Pipatsrisawat, A. Palyan, M. Chavira, A. Choi, and A. Darwiche. Solving weighted Max-SAT problems in a reduced search space: A performance analysis. Journal on Satisfiability, Boolean Modeling and Computation, 4:191-217, 2008.
41. M. Raḿ?rez and H. Geffner. Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP-2007, Providence/RI, USA, pages 605-619. Springer LNCS 4741, 2007.
42. H. Shen and H. Zhang. Study of lower bound functions for max-2-sat. In Proceedings of the 19th National Conference on Artificial Intelligence, AAAI-2004, San Jose/CA, USA, pages 185-190, 2004.
43. R. J. Wallace and E. Freuder. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability, volume 26, pages 587-615. American Mathematical Society, 1996.
44. Z. Xing and W. Zhang. Efficient strategies for (weighted) maximum satisfiability. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, CP-2004, Toronto, Canada, pages 690-705. Springer, LNCS 3258, 2004.
45. Z. Xing and W. Zhang. An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence, 164(2):47-80, 2005.
46. M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 17:475-502, 1994.
47. H. Zhang, H. Shen, and F. Manỳa. Exact algorithms for MAX-SAT. Electronic Notes in Theoretical Computer Science, 86(1), 2003.