Back to Results
First PageMeta Content
Theoretical computer science / NP-complete problems / Formal methods / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Isabelle / Constructible universe / LCF / Mathematics / (SAT /  -UNSAT)


Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber
Add to Reading List

Document Date: 2005-09-13 07:36:36


Open Document

File Size: 351,69 KB

Share Result on Facebook