Integrating a SAT Solver with an LCF-style Theorem Prover

doi:10.1016/j.entcs.2005.12.007

Electronic Notes in Theoretical Computer Science

Volume 144, Issue 2, 19 January 2006, Pages 67-78

https://doi.org/10.1016/j.entcs.2005.12.007 Get rights and content

Under a Creative Commons license

open access

Abstract

This paper describes the integration of a leading SAT solver with Isabelle/HOL, a popular interactive theorem prover. The SAT solver generates resolution-style proofs for (instances of) propositional tautologies. These proofs are verified by the theorem prover. The presented approach significantly improves Isabelle's performance on propositional problems, and furthermore exhibits counterexamples for unprovable conjectures.

Keywords

SAT solver

propositional resolution

proof checking

LCF-style theorem prover

Cited by (0)

¹: This work was supported by the PhD program Logic in Computer Science of the German Research Foundation.