C. Ansótegui, M. L. Bonet, and J. Levy, Sat-based maxsat algorithms, Artificial Intelligence, vol.196, pp.77-105, 2013.

R. Ben-eliyahu and R. Dechter, On computing minimal models, Ann. Math. Artif. Intell, vol.18, issue.1, pp.3-27, 1996.

M. C. Cooper, S. Cussat-blanc, M. De-roquemaurel, and P. Regnier, Soft arc consistency applied to optimal planning, Principles and Practice of Constraint Programming (CP), pp.680-684, 2006.

J. Davies and F. Bacchus, Solving MAXSAT by solving a sequence of simpler SAT instances, Principles and Practice of Constraint Programming (CP), pp.225-239, 2011.

J. Davies and F. Bacchus, Postponing optimization to speed up MAXSAT solving, Principles and Practice of Constraint Programming (CP), pp.247-262, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02746030

N. Eén and N. Sörensson, An extensible sat-solver, Proceedings of Theory and Applications of Satisfiability Testing (SAT), pp.502-518, 2003.

A. Graça, I. Lynce, J. Marques-silva, and A. L. Oliveira, Efficient and accurate haplotype inference by combining parsimony and pedigree information, Proceedings of the 4th International Conference on Algebraic and Numeric Biology, pp.38-56, 2012.

F. Heras, J. Larrosa, and A. Oliveras, MiniMaxSAT: An efficient weighted Max-SAT solver, J. Artif. Intell. Res. (JAIR), vol.31, pp.1-32, 2008.

F. Heras, A. Morgado, and J. Marques-silva, Coreguided binary search algorithms for maximum satisfiability, Proceedings of the AAAI National Conference (AAAI), pp.36-41, 2011.

J. N. Hooker and G. Ottosson, Logic-based benders decomposition, Mathematical Programming, vol.96, issue.1, pp.33-60, 2003.

P. Kilby, J. K. Slaney, S. Thiébaux, and T. Walsh, Backbones and backdoors in satisfiability, Proceedings of the AAAI National Conference (AAAI), pp.1368-1373, 2005.

C. Li, F. Manyà, N. Mohamedou, and J. Planes, Exploiting cycle structures in Max-SAT, Proceedings of Theory and Applications of Satisfiability Testing (SAT), pp.467-480, 2009.

M. H. Liffiton and K. A. Sakallah, Algorithms for computing minimal unsatisfiable subsets of constraints, Journal of Automated Reasoning, vol.40, issue.1, pp.1-33, 2008.

J. Marques-silva, F. Heras, M. Janota, A. Previti, and A. Belov, On computing minimal correction subsets, Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pp.615-622, 2013.

J. Marques-silva, I. Lynce, and S. Malik, Conflictdriven clause learning SAT solvers, Handbook of Satisfiability, pp.131-153, 2009.

R. Reiter, A theory of diagnosis from first principles, Artificial Intelligence, vol.32, issue.1, pp.57-95, 1987.

T. Soh and K. Inoue, Identifying necessary reactions in metabolic pathways by minimal model generation, Proceedings of the European Conference on Artificial Intelligence (ECAI), pp.277-282, 2010.

D. M. Strickland, E. Barnes, and J. S. Sokol, Optimal protein structure alignment using maximum cliques, Operations Research, vol.53, issue.3, pp.389-402, 2005.

M. Vasquez and J. Hao, A "logic-constrained" knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite, Comp. Opt. and Appl, vol.20, issue.2, pp.137-157, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00359386

L. Zhang and F. Bacchus, Maxsat heuristics for cost optimal planning, Proceedings of the AAAI National Conference (AAAI), pp.1846-1852, 2012.