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

	A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1 DocID: 1qJgp - View Document
	Solving Satisfiability Problems with Qualitative Preferences: a New Approach Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea DIST - Universit`a di Genova, Italy. email:{emanuele,enrico,marco}@dist.unige.it Abstra DocID: 1qDJG - View Document
	Preprocessing Techniques for QBFs Enrico Giunchiglia1 , Paolo Marin1 , and Massimo Narizzano1 DIST - Universit`a di Genova Viale Causa 13, 16145 Genova, Italy Abstract DocID: 1pPHH - View Document
	Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck DocID: 1pNco - View Document