First Page | Document Content | |
---|---|---|
Date: 2005-09-13 07:36:36Theoretical 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 WeberAdd to Reading ListSource URL: user.it.uu.seDownload Document from Source WebsiteFile Size: 351,69 KBShare Document on Facebook |