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

First Page		Document Content
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

	Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive t DocID: 1rlXv - View Document
	A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi DocID: 1rjEK - View Document
	Reconciling Semantics, Implementation and Users Gérard Berry INRIA Sophia-Antipolis http://www-sop.inria.fr/Gerard.Berry DocID: 1r68x - View Document
	Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel† DocID: 1qvnK - View Document
	LEO-II and Satallax on the Sledgehammer Test Bench Nik Sultanaa,∗, Jasmin Christian Blanchetteb , Lawrence C. Paulsona a Computer b Institut Laboratory, University of Cambridge, United Kingdom DocID: 1qfS7 - View Document