B. Beezer and R. A. , A first course in linear algebra, 2008.

P. Chatalic and L. Simon, Davis et Putnam, 40 ans après : une première expérimentation, Actes des Sixièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets, pp.9-16, 1999.

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

R. Dechter and I. Rish, Directional resolution : The davis-putnam procedure, revisited, pp.134-145, 1994.

N. Eén and N. Sörensson, An extensible sat-solver, Theory and applications of satisfiability testing, pp.502-518, 2003.

J. Gagneur and S. Klamt, Computation of elementary modes : a unifying framework and the new binary approach, BMC bioinformatics, vol.5, issue.1, p.1, 2004.

M. P. Gerstl, C. Jungreuthmayer, and J. Zanghellini, tEFMA: computing thermodynamically feasible elementary flux modes in metabolic networks, Bioinformatics, vol.31, issue.13, p.111, 2015.
DOI : 10.1093/bioinformatics/btv111

M. P. Gerstl, D. E. Ruckerbauer, D. Mattanovich, C. Jungreuthmayer, and J. Zanghellini, Metabolomics integrated elementary flux mode analysis in large metabolic networks Scientific reports, p.8930, 2015.

C. P. Gomes, B. Selman, N. Crato, and H. Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, Journal of Automated Reasoning, vol.24, issue.1/2, pp.67-100, 2000.
DOI : 10.1023/A:1006314320276

S. Haim and M. Heule, Towards ultra rapid restarts. arXiv preprint arXiv, pp.1402-4413, 2014.

Y. Hamadi, S. Jabbour, and L. Sais, Manysat : a parallel sat solver, Journal on Satisfiability Boolean Modeling and Computation, vol.6, pp.245-262, 2008.

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

C. Jungreuthmayer, M. Beurton-aimar, and J. Zanghellini, Fast Computation of Minimal Cut Sets in Metabolic Networks with a Berge Algorithm that Utilizes Binary Bit Pattern Trees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, issue.5, pp.1-1, 2013.
DOI : 10.1109/TCBB.2013.116

C. Jungreuthmayer, D. E. Ruckerbauer, and J. Zanghellini, Utilizing gene regulatory information to speed up the calculation of elementary flux modes. arXiv preprint, 2012.

C. Jungreuthmayer, D. E. Ruckerbauer, and J. Zanghellini, regEfmtool: Speeding up elementary flux mode calculation using transcriptional regulatory rules in the form of three-state logic, Biosystems, vol.113, issue.1, pp.37-39, 2013.
DOI : 10.1016/j.biosystems.2013.04.002

S. Klamt, J. Gagneur, V. Kamp, and A. , Algorithmic approaches for computing elementary modes in large biochemical reaction networks, IEE Proceedings - Systems Biology, vol.152, issue.4, pp.249-255, 2005.
DOI : 10.1049/ip-syb:20050035

S. Klamt and E. D. Gilles, Minimal cut sets in biochemical reaction networks, Bioinformatics, vol.20, issue.2, pp.226-234, 2004.
DOI : 10.1093/bioinformatics/btg395

S. Klamt, J. Saez-rodriguez, G. , and E. D. , Structural and functional analysis of cellular networks with cellnetanalyzer, BMC systems biology, vol.1, issue.1, p.1, 2007.

M. Koshimura, H. Nabeshima, H. Fujita, and R. Hasegawa, Minimal model generation with respect to an atom set. First-order Theorem Proving FTP, p.49, 2009.

N. E. Lewis, H. Nagarajan, and B. O. Palsson, Constraining the metabolic genotype???phenotype relationship using a phylogeny of in silico methods, Nature Reviews Microbiology, vol.6, issue.4, pp.291-305, 2012.
DOI : 10.1038/nrmicro2737

J. H. Liang, V. Ganesh, E. Zulkoski, A. Zaman, and K. Czarnecki, Understanding VSIDS Branching Heuristics in??Conflict-Driven Clause-Learning SAT Solvers, Haifa Verification Conference, pp.225-241, 2015.
DOI : 10.1007/978-3-319-26287-1_14

G. Long, S. Jabbour, L. , and S. , Stratégies d'élimination des clauses apprises dans les solveurs sat modernes, 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), pp.147-156, 2013.

M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of las vegas algorithms, Proceedings of the 2nd Israel Symposium on the Theory and Computing Systems, pp.128-133, 1993.

M. Morterol, P. Dague, S. Peres, and L. Simon, Minimality of metabolic flux modes under boolean regulation constraints, 12th International Workshop on Constraint-Based Methods for Bioinformatics (WCB'16), 2016.

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

T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, 3. The Double Description Method, Contributions to the Theory of Games II, pp.51-73, 1953.
DOI : 10.1515/9781400881970-004

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT Modulo Theories, Journal of the ACM, vol.53, issue.6, pp.53937-977, 2006.
DOI : 10.1145/1217856.1217859

J. D. Orth, I. Thiele, and B. Ø. Palsson, What is flux balance analysis ? Nature biotechnology, pp.245-248, 2010.
DOI : 10.1038/nbt.1614
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3108565

S. Peres, Analyse de la structure des réseaux métaboliques : application au métabolisme énergétique mitochondrial, 2005.

S. Peres, M. Morterol, and L. Simon, SAT-Based Metabolics Pathways Analysis without Compilation, Lecture Note in Bioinformatics, vol.8859, pp.20-31, 2014.
DOI : 10.1007/978-3-319-12982-2_2
URL : https://hal.archives-ouvertes.fr/hal-01108840

S. Peres, F. Vallée, M. Beurton-aimar, and J. Mazat, ACoM: A classification method for elementary flux modes based on motif finding, Biosystems, vol.103, issue.3, pp.410-419, 2011.
DOI : 10.1016/j.biosystems.2010.12.001
URL : https://hal.archives-ouvertes.fr/hal-00629161

K. Pipatsrisawat and A. Darwiche, A Lightweight Component Caching Scheme for Satisfiability Solvers, Theory and Applications of Satisfiability Testing?SAT 2007, pp.294-299, 2007.
DOI : 10.1007/978-3-540-72788-0_28

F. Planes and J. Beasley, Path finding approaches and metabolic pathways, Discrete Applied Mathematics, vol.157, issue.10, pp.2244-2256, 2009.
DOI : 10.1016/j.dam.2008.06.035
URL : http://doi.org/10.1016/j.dam.2008.06.035

S. Schuster, T. Dandekar, and D. Fell, Description of the algorithm for computing elementary flux modes, 2000.

S. Schuster and C. Hilgetag, ON ELEMENTARY FLUX MODES IN BIOCHEMICAL REACTION SYSTEMS AT STEADY STATE, Journal of Biological Systems, vol.02, issue.02, pp.165-182, 1994.
DOI : 10.1142/S0218339094000131

J. P. Silva and K. A. Sakallah, Grasp?a new search algorithm for satisfiability, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, pp.220-227, 1997.

L. Simon, Oublier pour mieux régner : une courte étude expérimentale, Dixièmes Journées Francophones de Programmation par Contraintes, 2014.

A. C. Smith and A. J. Robinson, A metabolic model of the mitochondrion and its use in modelling diseases of the tricarboxylic acid cycle, BMC Systems Biology, vol.5, issue.1, pp.1-13, 2011.
DOI : 10.1016/S0006-3495(02)75297-1

T. Soh, K. Inoue, T. Baba, T. Takada, and T. Shiroishi, Predicting gene knockout effects by minimal pathway enumeration, The 4th International Conference on Bioinformatics, pp.11-19, 2012.

J. Stelling, S. Klamt, K. Bettenbrock, S. Schuster, G. et al., Metabolic network structure determines key aspects of functionality and regulation, Nature, vol.292, issue.6912, pp.420190-193, 2002.
DOI : 10.1103/PhysRevE.64.036106

M. Terzer, Large scale methods to enumerate extreme rays and elementary modes, 2009.

M. Terzer and J. Stelling, Large-scale computation of elementary flux modes with bit pattern trees, Bioinformatics, vol.24, issue.19, pp.242229-2235, 2008.
DOI : 10.1093/bioinformatics/btn401

M. Terzer and J. Stelling, Parallel Extreme Ray and Pathway Computation, International Conference on Parallel Processing and Applied Mathematics, pp.300-309, 2009.
DOI : 10.1007/978-3-642-14403-5_32

I. Thiele, N. Swainston, R. M. Fleming, A. Hoppe, S. Sahoo et al., A community-driven global reconstruction of human metabolism, Nature Biotechnology, vol.8, issue.5, pp.31419-425, 2013.
DOI : 10.1093/bioinformatics/btp392

G. S. Tseitin, On the complexity of derivation in propositional calculus, Automation of reasoning, pp.466-483, 1983.

V. Kamp, A. Schuster, and S. , Metatool 5.0: fast and flexible elementary modes analysis, Bioinformatics, vol.22, issue.15, pp.221930-1931, 2006.
DOI : 10.1093/bioinformatics/btl267

C. Wagner, Nullspace Approach to Determine the Elementary Modes of Chemical Reaction Systems, The Journal of Physical Chemistry B, vol.108, issue.7, pp.2425-2431, 2004.
DOI : 10.1021/jp034523f

M. Yeung, I. Thiele, and B. Ø. Palsson, Estimation of the number of extreme pathways for metabolic networks, BMC Bioinformatics, vol.8, issue.1, p.1, 2007.
DOI : 10.1186/1471-2105-8-363

H. Zhang and M. Stickel, Implementing the davis?putnam method, Journal of Automated Reasoning, vol.24, issue.1/2, pp.277-296, 2000.
DOI : 10.1023/A:1006351428454