ZBDD-based backtrack search SAT solver, in: International Workshop on Logic Synthesis, 2002. ,
Refutations by Matings, IEEE Transactions on Computers, vol.25, issue.8, pp.801-807, 1976. ,
DOI : 10.1109/TC.1976.1674698
On Matrices with Connections, Journal of the ACM, vol.28, issue.4, pp.633-645, 1981. ,
DOI : 10.1145/322276.322277
Symbolic Model Checking without BDDs, Tools and Algorithms for Construction and Analysis of Systems, 1999. ,
DOI : 10.1007/3-540-49059-0_14
A machine program for theorem proving, Journal of the ACM, vol.5, 1962. ,
An Extensible SAT-solver, Theory and Applications of Satisfiability Testing, 6th International Conference, pp.502-518, 2003. ,
DOI : 10.1007/978-3-540-24605-3_37
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants, TACAS, pp.167-181, 2006. ,
DOI : 10.1007/3-540-45620-1_26
URL : https://hal.archives-ouvertes.fr/inria-00001088
Introduction to HOL : A theorem-proving environment for higher order logic, 1993. ,
Extended Resolution Proofs for Symbolic SAT Solving with Quantification, 9th Intl. Conf. on Theory and Applications of Satisfiability Testing, 2006. ,
DOI : 10.1007/11814948_8
A Proof Procedure Using Connection Graphs, Journal of the ACM, vol.22, issue.4, 1975. ,
DOI : 10.1145/321906.321919
Small Proof Witnesses for LF, LNCS, vol.3668, pp.387-401, 2005. ,
DOI : 10.1007/11562931_29
Using a SAT solver as a fast decision procedure for propositional logic in an LCF-style theorem prover, Theorem Proving in Higher Order Logics -Emerging Trends Proceedings, 2005. ,
Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications, Europe Conference and Exposition (DATE), pp.10880-10885, 2003. ,