Synthesis of Propositional Satisfiability Solvers Douglas R. Smith Stephen J. Westfold Kestrel Institute Palo Alto, CA, 94304 USA

First Page		Document Content
Date: 2012-08-02 20:25:03 Mathematics Algebra Abstract algebra Boolean algebra Algebraic structures Logic in computer science Constraint programming Boolean satisfiability problem Electronic design automation DPLL algorithm Conjunctive normal form Boolean		Synthesis of Propositional Satisfiability Solvers Douglas R. Smith Stephen J. Westfold Kestrel Institute Palo Alto, CA, 94304 USA Add to Reading List Source URL: www.kestrel.edu Download Document from Source Website File Size: 469,00 KB Share Document on Facebook

	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” DocID: 1qJex - View Document
	Microsoft Word - IBSdoc DocID: 1qERD - View Document
	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc DocID: 1qzAi - View Document
	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk DocID: 1qorC - View Document