| 2009 | PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing. | Matthew Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia |
| 2009 | Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates. | Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodrguez-Carbonell |
| 2009 | Relaxed DPLL Search for MaxSAT. | Lukas Kroc, Ashish Sabharwal, Bart Selman |
| 2009 | Finding Efficient Circuits Using SAT-Solvers. | Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev |
| 2009 | Efficient Term-ITE Conversion for Satisfiability Modulo Theories. | Hyondeuk Kim, Fabio Somenzi, HoonSang Jin |
| 2009 | Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. | Daniel Johannsen, Igor Razgon, Magnus Wahlstrm |
| 2009 | An Exponential Lower Bound for Width-Restricted Clause Learning. | Jan Johannsen |
| 2009 | VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search. | Eric I. Hsu, Sheila A. McIlraith |
| 2009 | On-the-Fly Clause Improvement. | HyoJung Han, Fabio Somenzi |
| 2009 | Restart Strategy Selection Using Machine Learning Techniques. | Shai Haim, Toby Walsh |
| 2009 | Beyond CNF: A Circuit-Based QBF Solver. | Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus |
| 2009 | Boundary Points and Resolution. | Eugene Goldberg |
| 2009 | Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. | Allen Van Gelder |
| 2009 | Backdoors in the Context of Learning. | Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal |
| 2009 | (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. | Nadia Creignou, Herv Daud, Uwe Egly, Raphal Rossignol |
| 2009 | Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques. | Jingchao Chen |
| 2009 | Finding Lean Induced Cycles in Binary Hypercubes. | Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leopold Haller |
| 2009 | Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. | Hans Kleine Bning, Xishun Zhao, Uwe Bubeck |
| 2009 | Efficiently Calculating Evolutionary Tree Measures Using SAT. | Maria Luisa Bonet, Katherine St. John |
| 2009 | The Complexity of Reasoning for Fragments of Default Logic. | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
| 2009 | Does Advice Help to Prove Propositional Tautologies? | Olaf Beyersdorff, Sebastian Mller |
| 2009 | Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. | Timo Berthold, Stefan Heinz, Marc E. Pfetsch |
| 2009 | Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. | Anton Belov, Zbigniew Stachniak |
| 2009 | A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem. | Adrian Balint, Michael Henn, Oliver Gableske |
| 2009 | New Encodings of Pseudo-Boolean Constraints into CNF. | Olivier Bailleux, Yacine Boufkhad, Olivier Roussel |