Vol 1 (2006)

Includes a Special Issue on SAT/CP Integration

Table of Contents

Articles

Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems PDF
Miguel F. Anjos 1-47
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length PDF
Evgeny Dantsin, Alexander Wolpert 49-60
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages PDF
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis 61-88
Extending Existential Quantification in Conjunctions of BDDs PDF
Sean Weaver, John Franco, John Schlipf 89-110
Improved Bound for the PPSZ/Schoening-Algorithm for 3-SAT PDF
Daniel Rolf 111-122
Impurity: Another Phase Transition of SAT PDF
Eliezer L. Lozinskii 123-141
A Note on the Use of Independent Sets for the k-SAT Problem PDF
Konstantin Kutzkov 143-145

Special Issue on SAT/CP Integration

Preface to Special Issue on SAT/CP Integration PDF
Youssef Hamadi, Lucas Bordeaux
Recording and Minimizing Nogoods from Restarts PDF
Christophe Lecoutre, Lakhdar Sais, Sebastien Tabary, Vincent Vidal 147-167
Using SAT Encodings to Derive CSP Value Ordering Heuristics PDF
Christophe Lecoutre, Lakhdar Saıs, Julien Vion 169-186
Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic PDF
Shuvendu K. Lahiri, Krishna K. Mehra 187-207
Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure PDF
Martin Franzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert 209-236