Checkable Proofs for First-Order Theorem Proving Giles Reger1 , Martin Suda2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria

First Page		Document Content
Date: 2017-08-08 03:28:45 Software Automated theorem proving Theoretical computer science Formal methods TPTP Proof assistant Frama-C Theorem prover E theorem prover Theorem Isabelle		Checkable Proofs for First-Order Theorem Proving Giles Reger1 , Martin Suda2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 194,64 KB Share 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 Weber DocID: 1xVu1 - View Document
	Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover DocID: 1xV3j - View Document
	An Explicating Theorem Prover for Quantified Formulas DocID: 1xUv4 - View Document
	Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK DocID: 1xUhM - View Document
	Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3 DocID: 1xU88 - View Document