The Ackermann Award 2009 J.A. Makowsky and A. Razborov Members of EACSL Jury for the Ackermann Award The ﬁfth Ackermann Award is presented at this CSL’09, held in Coimbra, Portugal. This is the third year in which th

First Page		Document Content
Date: 2013-12-08 17:58:05 Logic Wilhelm Ackermann Alexander Razborov Proof complexity DPLL algorithm Resolution Computational complexity theory Ackermann function Propositional proof system Theoretical computer science Mathematics Automated theorem proving		The Ackermann Award 2009 J.A. Makowsky and A. Razborov Members of EACSL Jury for the Ackermann Award The ﬁfth Ackermann Award is presented at this CSL’09, held in Coimbra, Portugal. This is the third year in which th Add to Reading List Source URL: eacsl.kahle.ch Download Document from Source Website File Size: 70,63 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