H. Amjad, Compressing Propositional Refutations, Electronic Notes in Theoretical Computer Science, vol.185, pp.3-15, 2007.
DOI : 10.1016/j.entcs.2007.05.025
URL : https://hal.archives-ouvertes.fr/inria-00089495

O. Bar-ilan, O. Fuhrmann, S. Hoory, O. Shacham, and O. Strichman, Linear-Time Reductions of Resolution Proofs, Haifa Verification Conference, pp.114-128, 2008.
DOI : 10.1007/3-540-44798-9_4

N. Bjørner and V. Sofronie-stokkermans, Automated Deduction -CADE-23, 23rd International Conference on Automated Deduction, 2011.
DOI : 10.1007/978-3-642-22438-6

J. C. Blanchette, S. Böhme, and L. C. Paulson, Extending Sledgehammer with SMT Solvers, Bjørner and Sofronie-Stokkermans [3], pp.116-130
DOI : 10.1007/BFb0028402
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.194.1769

T. Bouton, D. C. De-oliveira, D. Déharbe, and P. Fontaine, veriT: An Open, Trustable and Efficient SMT-Solver, Lecture Notes in Computer Science, vol.144, issue.2, pp.151-156, 2009.
DOI : 10.1007/978-3-540-73595-3_38
URL : https://hal.archives-ouvertes.fr/inria-00430634

C. E. Brown, Satallax: An Automatic Higher-Order Prover, Lecture Notes in Computer Science, vol.7364, pp.111-117, 2012.
DOI : 10.1007/978-3-642-31365-3_11

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

S. Cotton, Two Techniques for Minimizing Resolution Proofs, Theory and Applications of Satisfiability Testing SAT 2010, pp.306-312, 2010.
DOI : 10.1007/978-3-642-14186-7_26

P. Fontaine, S. Merz, and B. Paleo, Exploring and exploiting algebraic and graphical properties of resolution, 8th International Workshop on Satisfiability Modulo Theories -SMT 2010, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00544658

P. Fontaine, S. Merz, and B. Paleo, Compression of Propositional Resolution Proofs via Partial Regularization, Bjørner and Sofronie-Stokkermans [3], pp.237-251
DOI : 10.1007/978-3-642-14186-7_26
URL : https://hal.archives-ouvertes.fr/inria-00617846

A. Goerdt, Comparing the Complexity of Regular and Unrestricted Resolution, pp.181-185, 1990.
DOI : 10.1007/978-3-642-76071-6_20

M. Järvisalo, L. Berre, D. Roussel, O. Simon, and L. , The international SAT solver competitions, AI Magazine, vol.33, issue.1, pp.89-92, 2012.

K. Korovin, iProver ??? An Instantiation-Based Theorem Prover for First-Order Logic (System Description), Lecture Notes in Computer Science, vol.5195, pp.292-298, 2008.
DOI : 10.1007/978-3-540-71070-7_24

S. F. Rollini, R. Bruttomesso, and N. Sharygina, An Efficient and Flexible Approach to Resolution Proof Reduction, Hardware and Software: Verification and Testing, pp.182-196, 2011.
DOI : 10.1007/978-3-642-19583-9_17

C. Sinz, R. Moreno-díaz, and F. Pichler, Compressing Propositional Proofs by Common Subproof Extraction, Lecture Notes in Computer Science, vol.4739, pp.547-555, 2007.
DOI : 10.1007/978-3-540-75867-9_69

G. S. Tseitin, On the complexity of derivation in propositional calculus Automation of Reasoning: Classical Papers in Computational Logic, 1967.