| 2003 | On Computing k-CNF Formula Properties. | Ryan Williams |
| 2003 | On Fixed-Parameter Tractable Parameterizations of SAT. | Stefan Szeider |
| 2003 | A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods. | Guilhem Semerjian, Rmi Monasson |
| 2003 | Using Problem Structure for Efficient Clause Learning. | Ashish Sabharwal, Paul Beame, Henry A. Kautz |
| 2003 | Hypergraph Reductions and Satisfiability Problems. | Daniele Pretolani |
| 2003 | Local Search on SAT-encoded Colouring Problems. | Steven D. Prestwich |
| 2003 | Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. | Stefan Porschen, Bert Randerath, Ewald Speckenmeyer |
| 2003 | On the Probabilistic Approach to the Random Satisfiability Problem. | Giorgio Parisi |
| 2003 | Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. | Maher N. Mneimneh, Karem A. Sakallah |
| 2003 | Hidden Threshold Phenomena for Fixed-Density SAT-formulae. | Hans van Maaren, Linda van Norden |
| 2003 | A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. | Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez |
| 2003 | The Combinatorics of Conflicts between Clauses. | Oliver Kullmann |
| 2003 | A Case for Efficient Solution Enumeration. | Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson |
| 2003 | Conflict-Based Selection of Branching Rules. | Marc Herbstritt, Bernd Becker |
| 2003 | Density Condensation of Boolean Formulas. | Youichi Hanatani, Takashi Horiyama, Kazuo Iwama |
| 2003 | How Good Can a Resolution Based SAT-solver Be? | Eugene Goldberg, Yakov Novikov |
| 2003 | Watched Data Structures for QBF Solvers. | Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella |
| 2003 | SBSAT: a State-Based, BDD-Based Satisfiability Solver. | John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet |
| 2003 | Comparing Different Prenexing Strategies for Quantified Boolean Formulas. | Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda |
| 2003 | An Extensible SAT-solver. | Niklas En, Niklas Srensson |
| 2003 | Satisfiability and Computing van der Waerden Numbers. | Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski |
| 2003 | The Interaction Between Inference and Branching Heuristics. | Lyndon Drake, Alan M. Frisch |
| 2003 | kcnfs: An Efficient Solver for Random k-SAT Formulae. | Gilles Dequen, Olivier Dubois |
| 2003 | SAT Based Predicate Abstraction for Hardware Verification. | Edmund M. Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang |
| 2003 | An Algorithm for SAT Above the Threshold. | Hubie Chen |