| 2008 | Designing an Efficient Hardware Implication Accelerator for SAT Solving. | John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang |
| 2008 | New Results on the Phase Transition for Random Quantified Boolean Formulas. | Nadia Creignou, Herv Daud, Uwe Egly, Raphal Rossignol |
| 2008 | Adaptive Restart Strategies for Conflict Driven SAT Solvers. | Armin Biere |
| 2008 | A Generalized Framework for Conflict Analysis. | Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Sad Jabbour, Lakhdar Sais |
| 2008 | A Preprocessor for Max-SAT Solvers. | Josep Argelich, Chu Min Li, Felip Many |
| 2008 | Modelling Max-CSP as Partial Max-SAT. | Josep Argelich, Alba Cabiscol, Ins Lynce, Felip Many |
| 2007 | Matched Formulas and Backdoor Sets. | Stefan Szeider |
| 2007 | Fault Localization and Correction with QBF. | Stefan Staber, Roderick Bloem |
| 2007 | Satisfiability with Exponential Families. | Dominik Scheder, Philipp Zumstein |
| 2007 | Dynamically Partitioning for Solving QBF. | Horst Samulowitz, Fahiem Bacchus |
| 2007 | Backdoor Sets of Quantified Boolean Formulas. | Marko Samer, Stefan Szeider |
| 2007 | Variable Dependency in Local Search: Prevention Is Better Than Cure. | Steven D. Prestwich |
| 2007 | Algorithms for Variable-Weighted 2-SAT and Dual Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2007 | A Lightweight Component Caching Scheme for Satisfiability Solvers. | Knot Pipatsrisawat, Adnan Darwiche |
| 2007 | Encodings of Problems in Effectively Propositional Logic. | Juan Antonio Navarro Prez, Andrei Voronkov |
| 2007 | Efficient Circuit to CNF Conversion. | Panagiotis Manolios, Daron Vroon |
| 2007 | On the Boolean Connectivity Problem for Horn Relations. | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
| 2007 | Breaking Symmetries in SAT Matrix Models. | Ins Lynce, Joo Marques-Silva |
| 2007 | Solving Multi-objective Pseudo-Boolean Problems. | Martin Lukasiewycz, Michael Gla, Christian Haubelt, Jrgen Teich |
| 2007 | Combining Adaptive Noise and Look-Ahead in Local Search for SAT. | Chu Min Li, Wanxia Wei, Harry Zhang |
| 2007 | Horn Upper Bounds and Renaming. | Marina Langlois, Robert H. Sloan, Gyrgy Turn |
| 2007 | Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. | Oliver Kullmann |
| 2007 | Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. | Arist Kojevnikov |
| 2007 | A First Step Towards a Unified Proof Checker for QBF. | Toni Jussila, Armin Biere, Carsten Sinz, Daniel Krning, Christoph M. Wintersteiger |
| 2007 | Effective Incorporation of Double Look-Ahead Procedures. | Marijn Heule, Hans van Maaren |