First Page | Document Content | |
---|---|---|
Date: 2005-09-13 07:36:26Proof assistants Theoretical computer science Logic in computer science Mathematical logic Isabelle Logic for Computable Functions Mathematics Resolution Constructible universe Theorem prover LCF Formal methods | Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark WeberAdd to Reading ListSource URL: user.it.uu.seDownload Document from Source WebsiteFile Size: 1,03 MBShare Document on Facebook |
Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark WeberDocID: 1xVu1 - View Document | |
Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark WeberDocID: 1xTZE - View Document | |
PDF DocumentDocID: 1xhpZ - View Document | |
PDF DocumentDocID: 1xeOW - View Document | |
PDF DocumentDocID: 1vZme - View Document |