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

	Proceedings of the CADE-25 ATP System Competition CASC-25 Geo↵ Sutcli↵e University of Miami, USA Abstract DocID: 1qH8X - View Document
	Proceedings of the 6th International Workshop on the Implementation of Logics Christoph Benzm¨ uller, Bernd Fischer, Geoff Sutcliffe DocID: 1qjaE - View Document
	The Applicability of Logic Program Analysis and Transformation to Theorem Proving 1 D.A. de Waal DocID: 1pBlm - View Document
	Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette · Sascha Böhme · Lawrence C. Paulson DocID: 1pyfq - View Document
	Interactive Theorem Proving in Industry John Harrison Intel Corporation 16 April 2012 DocID: 1oNzB - View Document