| 1 | -- | 34 | Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann. On SAT instance classes and a method for reliable performance experiments with SAT solvers |
| 35 | -- | 50 | Renato Bruni. On exact selection of minimally unsatisfiable subformulae |
| 51 | -- | 63 | Philippe Chapdelaine, Nadia Creignou. The complexity of Boolean constraint satisfaction local search problems |
| 65 | -- | 89 | Eugene Goldberg. Testing satisfiability of CNF formulas by computing a stable set of points |
| 91 | -- | 111 | Edward A. Hirsch, Arist Kojevnikov. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination |
| 113 | -- | 127 | Hans Kleine Büning, Daoyun Xu. The complexity of homomorphisms and renamings for minimal unsatisfiable formulas |
| 129 | -- | 136 | Gabor Kusper. Solving the resolution-free SAT problem by submodel propagation in linear time |
| 137 | -- | 152 | Inês Lynce, João P. Marques Silva. Efficient data structures for backtrack search SAT solvers |
| 153 | -- | 172 | Simona Cocco, Rémi Monasson. Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT |
| 173 | -- | 193 | Stefan Porschen, Bert Randerath, Ewald Speckenmeyer. Exact 3-satisfiability is decidable in time O(2:::0.16254::::n:::::::) |
| 195 | -- | 210 | Steven David Prestwich, Stéphane Bressan. A SAT approach to query optimization in mediator systems |
| 211 | -- | 221 | Daniele Pretolani. Probability logic and optimization SAT: The PSAT and CPA models |
| 223 | -- | 238 | Stefan Szeider. Generalizations of matched CNF formulas |
| 239 | -- | 253 | Allen Van Gelder. Toward leaner binary-clause reasoning in a satisfiability solver |
| 255 | -- | 294 | Uwe Egly, Reinhard Pichler, Stefan Woltran. On deciding subsumption problems |
| 295 | -- | 306 | Hans Kleine Büning, Xishun Zhao. Extension and equivalence problems for clause minimal formulae |
| 307 | -- | 342 | Laurent Simon, Daniel Le Berre, Edward A. Hirsch. The SAT2002 competition |
| 343 | -- | 365 | Paul W. Purdom, Daniel Le Berre, Laurent Simon. A parsimony tree for the SAT2002 competition |