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

	Syntax-Guided Optimal Synthesis for Chemical Reaction Networks∗ ˇ ska3 Martin Fr¨anzle4 , Marta Kwiatkowska2 , Luca Cardelli1,2 , Milan Ceˇ 2 Luca Laurenti , Nicola Paoletti5 , and Max Whitby2 DocID: 1xVI7 - View Document
	Parametric Higher-Order Abstract Syntax for Mechanized Semantics Adam Chlipala Harvard University DocID: 1xUkW - View Document
	[DSLDI14] Composable and Hygienic Typed Syntax Macros (TSMs) Cyrus Omar Chenglong (Stanley) Wang DocID: 1xUcw - View Document
	What’s in Main Tobias Nipkow August 15, 2018 Abstract This document lists the main types, functions and syntax provided by theory Main. It is meant as a quick overview of what is available. DocID: 1xTVU - View Document
	What’s in Main Tobias Nipkow August 15, 2018 Abstract This document lists the main types, functions and syntax provided by theory Main. It is meant as a quick overview of what is available. DocID: 1xTQ6 - View Document