| 2010 | Assignment Stack Shrinking. | Alexander Nadel, Vadim Ryvchin |
| 2010 | Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs. | Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker |
| 2010 | Uniquely Satisfiable | William Matthews, Ramamohan Paturi |
| 2010 | Towards Improving the Resource Usage of SAT-solvers. | Norbert Manthey, Ari Saptawijaya |
| 2010 | Improving Unsatisfiability-Based Algorithms for Boolean Optimization. | Vasco Manquinho, Ruben Martins, Ins Lynce |
| 2010 | An Exact Algorithm for the Boolean Connectivity Problem for | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
| 2010 | Integrating Dependency Schemes in Search-Based QBF Solvers. | Florian Lonsing, Armin Biere |
| 2010 | Exact MinSAT Solving. | Chu Min Li, Felip Many, Zhe Quan, Zhu Zhu |
| 2010 | Green-Tao Numbers and SAT. | Oliver Kullmann |
| 2010 | Improved Exact Solver for the Weighted MAX-SAT Problem. | Adrian Kgel |
| 2010 | An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. | Lukas Kroc, Ashish Sabharwal, Bart Selman |
| 2010 | SAT Solving with Reference Points. | Stephan Kottler |
| 2010 | A Non-prenex, Non-clausal QBF Solver with Game-State Learning. | William Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke |
| 2010 | Symmetry and Satisfiability: An Update. | Hadi Katebi, Karem A. Sakallah, Igor L. Markov |
| 2010 | Reconstructing Solutions after Blocked Clause Elimination. | Matti Jrvisalo, Armin Biere |
| 2010 | From Parallel SAT to Distributed SAT. | Youssef Hamadi |
| 2010 | Exploiting Circuit Representations in QBF Solving. | Alexandra Goultiaeva, Fahiem Bacchus |
| 2010 | sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning. | Enrico Giunchiglia, Paolo Marin, Massimo Narizzano |
| 2010 | Zero-One Designs Produce Small Hard SAT Instances. | Allen Van Gelder, Ivor T. A. Spence |
| 2010 | Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. | Carsten Fuhs, Peter Schneider-Kamp |
| 2010 | Minimising Deterministic Bchi Automata Precisely Using SAT Solving. | Rdiger Ehlers |
| 2010 | On Moderately Exponential Time for SAT. | Evgeny Dantsin, Alexander Wolpert |
| 2010 | Two Techniques for Minimizing Resolution Proofs. | Scott Cotton |
| 2010 | Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. | Uwe Bubeck, Hans Kleine Bning |
| 2010 | Automated Testing and Debugging of SAT and QBF Solvers. | Robert Brummayer, Florian Lonsing, Armin Biere |