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

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document