P. Barth, A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization, pp.95-97, 1995.

B. Benhamou, L. Sais, and P. Siegel, Two proof procedures for a cardinality based language in propositional calculus, 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 775 LNCS, pp.71-82, 1994.
DOI : 10.1007/3-540-57785-8_132

A. Bockmayr and F. Eisenbrand, Combining Logic and Optimization in Cutting Plane Theory, Lecture Notes in Computer Science, vol.1794, pp.1-17, 2000.
DOI : 10.1007/10720084_1
URL : https://hal.archives-ouvertes.fr/inria-00099172

D. Chai and A. Kuehlmann, A fast pseudo-boolean constraint solver, ACM/IEEE Design Automation Conference (DAC'03), pp.830-835, 2003.

W. Cook, C. Coullard, and G. Thuran, On the complexity of cutting-plane proofs, Discrete Applied Mathematics, vol.18, issue.1, pp.25-38, 1987.
DOI : 10.1016/0166-218X(87)90039-4

H. Dixon, Automated Pseudo-Boolean Inference within the DPLL framework, 2004.

B. Dutertre and L. Mendonça-de-moura, A Fast Linear-Arithmetic Solver for DPLL(T), Lecture Notes in Computer Science, vol.4144, pp.81-94, 2006.
DOI : 10.1007/11817963_11

N. Eén and N. Sörensson, An extensible satsolver, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing, pp.502-518, 2003.

E. Heidi, L. Dixon-matthew, and . Ginsberg, Combining satisfiability techniques from AI and OR, In The Knowledge Engineering Review, vol.15, p.53, 2000.

E. Heidi, L. Dixon-matthew, and . Ginsberg, Inference methods for a pseudo-boolean satisfiability solver, Proceedings of The Eighteenth National Conference on Artificial Intelligence (AAAI- 2002), pp.635-640, 2002.

R. Gomory, Outline of an algorithm for integer solutions to linar programs, pp.275-278, 1958.

J. N. Hooker14-]-v, J. Manquinho, and . Marques-silva, Generalized resolution and cutting planes, Boolean Modeling and Computation (JSAT), pp.217-239209, 1988.
DOI : 10.1007/BF02186368

P. Joao, K. A. Marques-silva, and . Sakallah, GRASP -A New Search Algorithm for Satisfiability, Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp.220-227, 1996.

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

R. Nieuwenhuis and A. Oliveras, Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools, Lecture Notes in Computer Science, vol.3835, pp.23-46, 2005.
DOI : 10.1007/11591191_3

R. Nieuwenhuis and A. Oliveras, On SAT Modulo Theories and Optimization Problems, Lecture Notes in Computer Science, vol.4121, pp.156-169, 2006.
DOI : 10.1007/11814948_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.1130

M. Hossein, K. A. Sheini, and . Sakallah, Pueblo : A Hybrid Pseudo-Boolean SAT Solver, Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.2, pp.165-182, 2006.

N. Eén and N. Sörensson, Translating pseudoboolean constraints into sat, Journal on Satisfiability , Boolean Modeling and Computation (JSAT), vol.2, pp.1-26, 2006.

V. Manquinho and O. Roussel, The first evaluation of pseudo-boolean solvers (pb'05), Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.2, pp.103-143, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00110082