. Ai/toulbar2,

S. De-givry,

G. Katsirelos,

M. Zytnicki, PhD, INRA) D. Allouche (INRA)

B. Donald,

K. Roberts,

T. Simonson,

J. Cortes,

, References I

A. Atserias, J. K. Fichte, and M. Thurley, Clause-learning algorithms with many restarts and bounded-width resolution, Journal of Artificial Intelligence Research, vol.40, pp.353-373, 2011.

G. Audemard and L. Simon, Predicting Learnt Clauses Quality in Modern SAT Solvers, International Joint Conference in AI, vol.9, pp.399-404, 2009.

M. Bruynooghe and L. Pereira, Deduction revision by intelligent backtracking, 1984.

, Publication statistics in CP per country every year

C. Martin and . Cooper, Soft arc consistency revisited, Artificial Intelligence, vol.174, pp.449-478, 2010.

M. Courbariaux, Binarized neural networks: Training deep neural networks with weights and activations constrained to+ 1 or-1, 2016.

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, pp.394-397, 1962.

M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM (JACM), vol.7, issue.3, pp.201-215, 1960.

L. De-moura and N. Bjørner, Satisfiability modulo theories: introduction and applications, Communications of the ACM, vol.54, pp.69-77, 2011.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, pp.273-312, 1990.

S. Foissac, Genome Annotation in Plants and Fungi: EuGène as a Model Platform, Current Bioinformatics, vol.3, pp.87-97, 2008.

K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für mathematik und physik, vol.38, pp.173-198, 1931.

P. Carla, B. Gomes, H. Selman, and . Kautz, Boosting combinatorial search through randomization, AAAI/IAAI 98, pp.431-437, 1998.

J. H. Marijn, O. Heule, . Kullmann, W. Victor, and . Marek, Solving and verifying the boolean pythagorean triples problem via cube-and-conquer, International Conference on Theory and Applications of Satisfiability Testing, pp.228-245, 2016.

B. Hurley, Multi-language evaluation of exact solvers in graphical model discrete optimization, Constraints, pp.1-22, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02633083

P. Jeavons and J. Petke, Local consistency and SAT-solvers, Journal of Artificial Intelligence Research, vol.43, pp.329-351, 2012.

G. Katz, Reluplex: An efficient SMT solver for verifying deep neural networks, International Conference on Computer Aided Verification, pp.97-117, 2017.

D. Koller and N. Friedman, Probabilistic graphical models: principles and techniques, 2009.

B. Kuhlman, Design of a novel globular protein fold with atomic-level accuracy, vol.302, pp.1364-1368, 2003.

O. Kullmann, The Science of Brute Force, Communications of the ACM, 2017.

J. Lafferty, A. Mccallum, and F. Pereira, Conditional random fields: Probabilistic models for segmenting and labeling sequence data, Proc. of the 18 t h International Conference on Machine Learning (ICML), 2001.

E. Lamb, Maths proof smashes size record: supercomputer produces a 200-terabyte proof-but is it really mathematics?, In: Nature, vol.534, pp.17-19, 2016.

P. João, . Marques-silva, A. Karem, and . Sakallah, GRASP: A search algorithm for propositional satisfiability, IEEE Transactions on Computers, vol.48, pp.506-521, 1999.

A. David and . Mcallester, An Outlook on Truth Maintenance, Artificial Intelligence Lab, 1980.

A. Morgado, Iterative and core-guided MaxSAT solving: A survey and assessment, Constraints 18, vol.4, pp.478-534, 2013.

W. Matthew and . Moskewicz, Chaff: Engineering an efficient SAT solver, Proceedings of the 38th annual Design Automation Conference, pp.530-535, 2001.

N. Narodytska, Verifying properties of binarized deep neural networks, 2017.

A. Niles, E. Pierce, and . Winfree, Protein design is NP-hard, Protein engineering, vol.15, pp.779-782, 2002.

R. John-alan, A machine-oriented logic based on the resolution principle, Journal of the ACM (JACM), vol.12, pp.23-41, 1965.

D. Röthlisberger, Kemp elimination catalysts by computational enzyme design, Nature, vol.453, p.190, 2008.

T. Schiex and G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problems, International Journal on Artificial Intelligence Tools, vol.3, pp.187-207, 1994.
URL : https://hal.archives-ouvertes.fr/hal-02847674

D. Simoncini, Guaranteed Discrete Energy Optimization on Large Protein Design Problems, Journal of Chemical Theory and Computation, vol.11, pp.5980-5989, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02637306

M. Richard, G. J. Stallman, and . Sussman, Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis, Artificial intelligence, vol.9, pp.135-196, 1977.

C. Szegedy, Intriguing properties of neural networks, 2013.

R. D. Arnout and . Voet, Computational design of a self-assembling symmetrical ?-propeller protein, Proceedings of the National Academy of Sciences, vol.111, pp.15102-15107, 2014.