M. Abseher, Nysret Musliu et Stefan Woltran : htd -A free, open-source framework for (customized) tree decompositions and beyond, Proc. of CPAIOR, pp.376-386, 2017.

G. Audemard and L. Simon, Predicting Learnt Clauses Quality in Modern SAT Solvers, Proc. of IJCAI, pp.399-404, 2009.

C. Berge, Hypergraphs : Combinatorics of Finite Sets, vol.45, 1984.

A. Biere, D. L. Berre, E. Lonca, and N. Manthey, Detecting Cardinality Constraints in CNF, Proc. of SAT, pp.285-301, 2014.

A. Biere and M. Heule, Hans van Maaren et Toby Walsh, éditeurs. Handbook of Satisfiability, volume 185 de Frontiers in Artificial Intelligence and Applications, 2009.

H. Burton, Bloom : Space/Time Trade-o s in Hash Coding with Allowable Errors, Commun. ACM, vol.13, issue.7, pp.422-426, 1970.

F. Boussemart, C. Lecoutre, and C. Piette, XCSP3 : An Integrated Format for Benchmarking Combinatorial Constrained Problems. CoRR, 2016.

C. Bron and J. Kerbosch, Algorithm 457 : Finding All Cliques of an Undirected Graph. Commun, vol.16, pp.575-577, 1973.

J. Elffers, J. Giráldez-cru, S. Gocht, J. Nordström, and L. Simon, Seeking practical CDCL insights from theoretical SAT benchmarks, Proc. of IJCAI, pp.1300-1308, 2018.

R. Fossé and L. Simon, On the Nondegeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers, Proc. of CP, pp.128-143, 2018.

G. Glorian, éditeurs : Proc. of 2018 XCSP3 Competition, pp.85-85, 2019.

É. Grégoire, R. Ostrowski, B. Mazure, and L. Sais, Automatic Extraction of Functional Dependencies, Proc. of SAT, 2004.

M. Heule, W. A. Hunt, . Et-nathan, and . Wetzler, Trimming while checking clausal proofs, Proc. of FMCAD, pp.181-188, 2013.

J. H. Marijn, Heule : Schur Number Five, Proc. of AAAI, pp.6598-6606, 2018.

J. H. Marijn and . Heule, Benjamin Kiesl et Armin Biere : Short Proofs Without New Variables, Proc. of CADE, pp.130-147, 2017.

J. H. Marijn and . Heule, Oliver Kullmann et Victor W. Marek : Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-andConquer, Proc. of SAT, pp.228-245, 2016.

M. Järvisalo, Marijn Heule et Armin Biere : Inprocessing Rules, Proc. of IJCAR, pp.355-370, 2012.

M. Järvisalo and A. Matsliah, Jakob Nordström et Stanislav Zivny : Relating Proof Complexity Measures and Practical Hardness of SAT, Proc. of CP, pp.316-331, 2012.

B. Kiesl, A. Rebola-pardo-et-marijn, and J. H. Heule, Extended Resolution Simulates DRAT, Proc. of IJCAR, pp.516-531, 2018.

A. Koeller, Integration of Heterogeneous Databases : Discovery of Meta-Information and Maintenance of Schema-Restructuring Views, 2001.

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Cha : Engineering an E cient SAT Solver, Proc. of DAC, pp.530-535, 2001.

R. Ostrowski, É. Grégoire, B. Mazure, and L. Sais, Recovering and exploiting structural knowledge from CNF formulas, Proc. of CP, pp.185-199, 2002.

L. Simon, Post Mortem Analysis of SAT Solver Proofs, Proc. of POS, pp.26-40, 2014.

G. Tseitin, On the Complexity of Derivation in Propositional Calculus, pp.466-483, 1983.

N. Wetzler, M. Heule, and W. A. Hunt, DRAT-trim : E cient Checking and Trimming Using Expressive Clausal Proofs, Proc. of SAT, pp.422-429, 2014.