T. Alsinet, F. Manyà, and J. Planes, Improved branch and bound algorithms for MAX-SAT

B. Borchers and J. Furman, A two-phase exact algorithm for MAX-SAT and weighted MAX- SAT problems, Journal of Combinatorial Optimization, vol.2, issue.4, pp.299-306, 1999.
DOI : 10.1023/A:1009725216438

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

O. Dubois, P. André, Y. Boufkhad, and J. Carlier, Can a very simple algorithm be efficient for solving the SAT problem?, Proc. of the DIMACS Challenge II Workshop, 1993.

O. Dubois and G. Dequen, A backbonesearch heuristic for efficient solving of hard 3-SAT formulae, Proc. of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), pp.248-253, 2001.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability , A Guide to the Theory of NP- Completeness, 1979.

N. John, V. Hooker, and . Vinay, Branching rules for satisfiability, Journal of Automated Reasoning, vol.15, issue.3, pp.359-383, 1995.

G. Robert, J. Jeroslow, and . Wang, Solving propositional satisfiability problems, Annals of Mathematics and Artificial Intelligence, vol.1, pp.167-187, 1990.

S. Joy, B. Borchers, and J. E. Mitchell, A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT, Satisfiability Problem: Theory and Applications, pp.519-536, 1997.
DOI : 10.1090/dimacs/035/13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.82.424

C. M. , L. , and A. Anbulagan, Heuristics based on unit propagation for satisfiability problems

D. Loveland, Automatic Theorem Proving, 1978.

J. Marques, S. , and K. A. Sakallah, GRASP: A new search algorithm for satisfiability, Proc. of the IEEE/ACM International Conference on Computer-Aided Design, pp.220-227, 1996.

D. G. Mitchell, B. Selman, and H. J. Levesque, Hard and easy distributions for SAT problems, Proc. of AAAI'92, pp.459-465, 1992.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, 2001.
DOI : 10.1145/378239.379017

R. Ostrowski, E. Grégoire, B. Mazure, and L. Sais, Recovering and Exploiting Structural Knowledge from CNF Formulas, Proc. of the 8th International Conference of Constraint Programming, pp.185-199, 2002.
DOI : 10.1007/3-540-46135-3_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.8117

B. Selman, H. A. Kautz, and B. Cohen, Noise strategies for improving local search, Proc. of the AAAI'94, pp.337-343, 1994.

B. Selman, H. J. Levesque, and D. G. Mitchell, A new method for solving hard satisfiability problems, Proc. of the AAAI'92, pp.440-446, 1992.

J. Richard, E. C. Wallace, and . Freuder, Comparative studies of constraint satisfaction and Davis- Putnam algorithms for maximum satisfiability problems, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp.587-615, 1996.

Z. Xing and W. Zhang, Efficient Strategies for (Weighted) Maximum Satisfiability, Proc of the 10th International Conference on Constraint Programming, pp.690-705, 2004.
DOI : 10.1007/978-3-540-30201-8_50

Z. Xing and W. Zhang, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, Artificial Intelligence, vol.164, issue.1-2, pp.47-80, 2005.
DOI : 10.1016/j.artint.2005.01.004

H. Zhang and . Sato, An efficient propositional prover, Proc. of the 14th International Conference on Automated Deduction, volume 1249 of LNAI, pp.272-275, 1997.
DOI : 10.1007/3-540-63104-6_28

H. Zhang, H. Shen, and F. Manyà, Exact Algorithms for MAX-SAT, Electronic Notes in Theoretical Computer Science, 2003.
DOI : 10.1016/S1571-0661(04)80663-7
URL : http://doi.org/10.1016/s1571-0661(04)80663-7