<--- Back to Details
First PageDocument Content
Proof assistants / Theoretical computer science / Logic in computer science / Mathematical logic / Isabelle / Logic for Computable Functions / Mathematics / Resolution / Constructible universe / Theorem prover / LCF / Formal methods
Date: 2005-09-13 07:36:26
Proof 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 Weber

Add to Reading List

Source URL: user.it.uu.se

Download Document from Source Website

File Size: 1,03 MB

Share Document on Facebook

Similar Documents

Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

DocID: 1xVu1 - View Document

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

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

DocID: 1xTZE - View Document

PDF Document

DocID: 1xhpZ - View Document

PDF Document

DocID: 1xeOW - View Document

PDF Document

DocID: 1vZme - View Document