![Mathematical logic / Mathematics / Theoretical computer science / Automated theorem proving / Logic in computer science / Methods of proof / Boolean algebra / Mathematical proofs / Proof complexity / Boolean satisfiability problem Mathematical logic / Mathematics / Theoretical computer science / Automated theorem proving / Logic in computer science / Methods of proof / Boolean algebra / Mathematical proofs / Proof complexity / Boolean satisfiability problem](https://www.pdfsearch.io/img/efef8f21674d6dab76148348ecb1be74.jpg) Date: 2017-08-06 02:05:36Mathematical logic Mathematics Theoretical computer science Automated theorem proving Logic in computer science Methods of proof Boolean algebra Mathematical proofs Proof complexity Boolean satisfiability problem | | The Potential of Interference-Based Proof Systems Marijn J.H. Heule and Benjamin Kiesl The University of Texas at Austin and Vienna University of Technology ARCADE in Gothenburg, SwedenAdd to Reading ListSource URL: www.cs.utexas.eduDownload Document from Source Website File Size: 128,49 KBShare Document on Facebook
|