MiniMaxSat: A new weighted Max-SAT solver

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

Volumn 4501 LNCS, Issue , 2007, Pages 41-55

  Heras, Federico ^a   Larrosa, Javier ^a   Oliveras, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT THEORY; LEARNING SYSTEMS; OPTIMIZATION;

LAZY PROPAGATION; TWO-WATCHED LITERALS SCHEME;

PROBLEM SOLVING;

EID: 38049156389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_8     Document Type: Conference Paper

References (30)

1. Papadimitriou, C.: Computational Complexity. Addison-Wesley, USA (1994)
2. Karloff, H.J., Zwick, U.: A 7/8-Approximation Algorithm for MAX 3SAT. In: FOCS. (1997)
3. Shen, H., Zhang, H.: Study of lower bounds for Max-2-SAT. In: AAAI. (2004)
4. Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency for weighted CSPs. In: IJCAI. (2005)
5. Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient max-sat solving. In: Available at the Computing Research Repository (http://arxiv.org/PS_cache/cs/ps/0611/0611025.ps.gz). (2006)
6. Xing, Z., Zhang, W.: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164 (2005) 47-80
7. th CP, Sitges, Spain (2005)
8. Li, C.M., Manyà, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat. In: AAAI. (2006)
9. Cha, B., Iwama, K., Kambayashi, Y., Miyazaki, S.: Local search algorithms for partial MAXSAT. In: AAAI/IAAI. (1997) 263-268
10. Alsinet, T., Manya, F., Planes, J.: Improved exact solver for weighted max-sat. In SAT05.
11. Argelich, J., Manyà, F.: Learning hard constraints in max-sat. In: CSCLP-2006. (2006) 1-12
12. Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into sat. Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 1-26
13. Eén, N., Sörensson, N.: An extensible sat-solver. In: Proceedings of SAT03. (2003) 502-518
14. Heras, F., Larrosa, J.: New inference rules for efficient max-sat solving. In: AAAI. (2006)
15. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: DAC (2001) 530-535
16. Tompkins, D.A.D., Hoos, H.H.: Ubcsat: An implementation and experimentation environment for sis algorithms for sat & max-sat. In: SAT. (2004)
17. Larrosa, J.: Node and arc consistency in weighted CSP. In: AAAI. (2002) 48-53
18. Lynce, I., Silva, J.P.M.: Probing-based preprocessing techniques for propositional satisfiability. In: ICTAI. (2003) 105-
19. Sheini, H.M., Sakallah, K.A.: Pueblo: A hybrid pseudo-boolean sat solver. Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 165-189
20. Li, C.M., Manyà, F., Planes, J.: New inference rules for max-sat. In: Submitted. (2006)
21. th IJCAI, Acapulco, Mexico (2003)
22. th CP, Kinsale, Ireland, LNCS 2833. Springer Verlag (2003) 363-376
23. th IJCAI, Edinburgh, U.K. (2005)
24. K. Leyton-Brown, M.P., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. ACM E-Commerce (2000) 66-76
25. Cooper, M., Cussat-Blanc, S., de Roquemaurel, M., Régnier, P.: Soft arc consistency applied to optimal planning. In: CP. (2006) 680-684
26. Walsh, T.: SAT v CSP. In: CP. (2000) 441-456
27. Lynce, I., Silva, J.P.M.: Efficient data structures for backtrack search sat solvers. Ann. Math. Artif. Intell. 43 (2005) 137-152
28. Zivan, R., Meisels, A.: Conflict directed backjumping for maxcsps. In: IJCAI. (2007)
29. Manquinho, V.M., Silva, J.P.M.: Satisfiability-based algorithms for boolean optimization. Ann. Math. Artif. Intell. 40 (2004) 353-372
30. Nieuwenhuis, R., Oliveras, A.: On SAT Modulo Theories and Optimization Problems. In: SAT. (2006) 156-169