The Potential of Interference-Based Proof Systems Marijn J.H. Heule1 and Benjamin Kiesl2 1 2 Department of Computer Science, The University of Texas at Austin

First Page		Document Content
Date: 2017-08-02 12:35:21 Logic Mathematical logic Mathematics Propositional calculus Logical truth Logic in computer science Syntax Automated theorem proving Resolution Frege system Boolean satisfiability problem First-order logic		The Potential of Interference-Based Proof Systems Marijn J.H. Heule1 and Benjamin Kiesl2 1 2 Department of Computer Science, The University of Texas at Austin Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 168,35 KB Share Document on Facebook

	A On the Power of Substitution in the Calculus of Structures Novak Novakovi´c, Inria Lutz Straßburger, Inria There are two contributions in this paper. First, we give a direct proof of the known fact that Frege system DocID: 1qGVY - View Document
	Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2 DocID: 1ggFx - View Document
	Proof complexity Boolean functions Craig’s interpolation Feasible interpolation Resolution Cutting planes The Frege System The interpolation technique in proof complexity Pavel Hrubeš University of Washington DocID: 1cllR - View Document
	Curriculum Vitae Samuel R. Buss Professor of Mathematics and Computer Science Department of Mathematics University of California, San Diego DocID: 18LzL - View Document
	Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf, DocID: 13xQC - View Document