| 2009 | (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol |
| 2009 | A Compact Representation for Syntactic Dependencies in QBFs. Florian Lonsing, Armin Biere |
| 2009 | A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem. Adrian Balint, Michael Henn, Oliver Gableske |
| 2009 | A Theoretical Analysis of Search in GSAT. Evgeny S. Skvortsov |
| 2009 | Algorithms for Weighted Boolean Optimization. Vasco Manquinho, João Marques-Silva, Jordi Planes |
| 2009 | An Exponential Lower Bound for Width-Restricted Clause Learning. Jan Johannsen |
| 2009 | Backdoors in the Context of Learning. Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal |
| 2009 | Beyond CNF: A Circuit-Based QBF Solver. Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus |
| 2009 | Boundary Points and Resolution. Eugene Goldberg |
| 2009 | Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates. Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell |
| 2009 | Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques. Jingchao Chen |
| 2009 | Cardinality Networks and Their Applications. Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell |
| 2009 | Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. Albert Atserias, Johannes Klaus Fichte, Marc Thurley |
| 2009 | Does Advice Help to Prove Propositional Tautologies? Olaf Beyersdorff, Sebastian Müller |
| 2009 | Dynamic Symmetry Breaking by Simulating Zykov Contraction. Bas Schaafsma, Marijn Heule, Hans van Maaren |
| 2009 | Efficient Term-ITE Conversion for Satisfiability Modulo Theories. Hyondeuk Kim, Fabio Somenzi, HoonSang Jin |
| 2009 | Efficiently Calculating Evolutionary Tree Measures Using SAT. Maria Luisa Bonet, Katherine St. John |
| 2009 | Encoding Treewidth into SAT. Marko Samer, Helmut Veith |
| 2009 | Exploiting Cycle Structures in Max-SAT. Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes |
| 2009 | Extending SAT Solvers to Cryptographic Problems. Mate Soos, Karsten Nohl, Claude Castelluccia |
| 2009 | Finding Efficient Circuits Using SAT-Solvers. Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev |
| 2009 | Finding Lean Induced Cycles in Binary Hypercubes. Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leopold Haller |
| 2009 | Generalizing Core-Guided Max-SAT. Mark H. Liffiton, Karem A. Sakallah |
| 2009 | Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. Allen Van Gelder |
| 2009 | Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. Anton Belov, Zbigniew Stachniak |
| 2009 | Instance-Based Selection of Policies for SAT Solvers. Mladen Nikolic, Filip Maric, Predrag Janicic |
| 2009 | Minimizing Learned Clauses. Niklas Sörensson, Armin Biere |
| 2009 | New Encodings of Pseudo-Boolean Constraints into CNF. Olivier Bailleux, Yacine Boufkhad, Olivier Roussel |
| 2009 | Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. Timo Berthold, Stefan Heinz, Marc E. Pfetsch |
| 2009 | On Some Aspects of Mixed Horn Formulas. Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
| 2009 | On-the-Fly Clause Improvement. HyoJung Han, Fabio Somenzi |
| 2009 | PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing. Matthew Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia |
| 2009 | Problem-Sensitive Restart Heuristics for the DPLL Procedure. Carsten Sinz, Ashlin Iser |
| 2009 | Relaxed DPLL Search for MaxSAT. Lukas Kroc, Ashish Sabharwal, Bart Selman |
| 2009 | Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. Hans Kleine Büning, Xishun Zhao, Uwe Bubeck |
| 2009 | Restart Strategy Selection Using Machine Learning Techniques. Shai Haim, Toby Walsh |
| 2009 | SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms. Robert Nieuwenhuis |
| 2009 | Sequential Encodings from Max-CSP into Partial Max-SAT. Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
| 2009 | Solving (Weighted) Partial MaxSAT through Satisfiability Testing. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy |
| 2009 | Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. Daniel Johannsen, Igor Razgon, Magnus Wahlström |
| 2009 | Symbolic Techniques in Propositional Satisfiability Solving. Moshe Y. Vardi |
| 2009 | The Complexity of Reasoning for Fragments of Default Logic. Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
| 2009 | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. Stefan Szeider |
| 2009 | Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings Oliver Kullmann |
| 2009 | VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search. Eric I. Hsu, Sheila A. McIlraith |
| 2009 | Variable Influences in Conjunctive Normal Forms. Patrick Traxler |
| 2009 | Width-Based Restart Policies for Clause-Learning Satisfiability Solvers. Knot Pipatsrisawat, Adnan Darwiche |
| 2009 | c-sat: A Parallel SAT Solver for Clusters. Kei Ohmura, Kazunori Ueda |