SAT Encodings Sugar Examples Demo Summary . .

First Page		Document Content
Date: 2010-07-15 03:14:22 Theoretical computer science Constraint programming Computational complexity theory Software engineering Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem DPLL algorithm Constraint satisfaction Solver		SAT Encodings Sugar Examples Demo Summary . . Add to Reading List Source URL: bach.istc.kobe-u.ac.jp Download Document from Source Website File Size: 552,42 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