K. Appel, W. Haken, and J. Koch, Every planar map is four colorable, Illinois J. Math, vol.21, issue.3, pp.491-567, 1977.
DOI : 10.1090/s0002-9904-1976-14122-5
URL : http://projecteuclid.org/download/pdf_1/euclid.bams/1183538218

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp.193-207, 1999.
DOI : 10.1007/3-540-49059-0_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8033

C. Chang and R. C. Lee, Symbolic Logic and Mechanical Theorem Proving, 1997.

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

H. Daumé, D. Iii, and . Marcu, Learning as search optimization, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.169-176, 2005.
DOI : 10.1145/1102351.1102373

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

M. Davis and H. Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.
DOI : 10.1145/321033.321034

W. F. Dowling and J. H. Gallier, Linear-time algorithms for testing the satisfiability of propositional horn formulae, The Journal of Logic Programming, vol.1, issue.3, pp.267-284, 1984.
DOI : 10.1016/0743-1066(84)90014-1

N. Eén and N. Sörensson, An extensible sat-solver, Theory and Applications of Satisfiability Testing, pp.333-336, 2004.

S. Even, A. Itai, and A. Shamir, On the complexity of time table and multi-commodity flow problems, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975), pp.184-193, 1975.
DOI : 10.1109/SFCS.1975.21

M. Fink, Online learning of search heuristics, Journal of Machine Learning Research -Proceedings Track, vol.2, pp.114-122, 2007.

J. W. Freeman, Improvements to propositional satisfiability search algorithms, 1995.

E. Goldberg and Y. Novikov, Berkmin: A fast and robust sat-solver, Design, Automation and Test in Europe Conference and Exhibition, 2002. Proceedings, pp.142-149, 2002.

J. Harrison, Handbook of Practical Logic and Automated Reasoning, 2009.
DOI : 10.1017/CBO9780511576430

J. N. Hooker and V. Vinay, Branching rules for satisfiability, Journal of Automated Reasoning, vol.90, issue.3, pp.359-383, 1995.
DOI : 10.1007/BF00881805
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.9685

F. Hutter, D. Babic, H. H. Hoos, and A. J. Hu, Boosting Verification by Automatic Tuning of Decision Procedures, Formal Methods in Computer Aided Design (FMCAD'07), pp.27-34, 2007.
DOI : 10.1109/FAMCAD.2007.9

R. G. Jeroslow and J. Wang, Solving propositional satisfiability problems, Annals of Mathematics and Artificial Intelligence, vol.21, issue.1-4, pp.167-187, 1990.
DOI : 10.1007/BF01531077

H. A. Kautz, Deconstructing planning as satisfiability, Proceedings of the Twenty-first National Conference on Artificial Intelligence (AAAI-06), 2006.

M. Kearns, M. Li, L. Pitt, and L. Valiant, On the learnability of Boolean formulae, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.285-295, 1987.
DOI : 10.1145/28395.28426

L. Berra and O. Roussel, Sat competition, 2009.

I. Lynce and J. Marques-silva, Efficient haplotype inference with boolean satisfiability, Proceedings of the 21st national conference on Artificial intelligence, pp.104-109, 2006.

M. Moskewicz, C. 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

F. Rosenblatt, The perceptron: A probabilistic model for information storage and organization in the brain., Psychological Review, vol.65, issue.6, pp.386-408, 1958.
DOI : 10.1037/h0042519

J. A. Silva, The impact of branching heuristics in propositional satisfiability algorithms, Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence, EPIA '99, pp.62-74, 1999.

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, Satzilla: portfolio-based algorithm selection for sat, J. Artif. Int. Res, vol.32, pp.565-606, 2008.

R. Zabih, A rearrangement search strategy for determining propositional satisfiability, Proceedings of the National Conference on Artificial Intelligence, pp.155-160, 1988.