On SAT instance classes and a method for reliable performance experiments with SAT solvers Franc BrglezXiao Yu LiMatthias F. Stallmann OriginalPaper 31 December 2004 Pages: 1 - 34
On exact selection of minimally unsatisfiable subformulae Renato Bruni OriginalPaper 31 December 2004 Pages: 35 - 50
The complexity of Boolean constraint satisfaction local search problems Philippe ChapdelaineNadia Creignou OriginalPaper 31 December 2004 Pages: 51 - 63
Testing satisfiability of CNF formulas by computing a stable set of points Eugene Goldberg OriginalPaper 31 December 2004 Pages: 65 - 89
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination Edward A. HirschArist Kojevnikov OriginalPaper 31 December 2004 Pages: 91 - 111
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas Hans Kleine BüningDaoyun Xu OriginalPaper 31 December 2004 Pages: 113 - 127
Solving the resolution-free SAT problem by submodel propagation in linear time Gábor Kusper OriginalPaper 31 December 2004 Pages: 129 - 136
Efficient data structures for backtrack search SAT solvers Inês LynceJoão Marques-Silva OriginalPaper 31 December 2004 Pages: 137 - 152
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 Simona CoccoRémi Monasson OriginalPaper 31 December 2004 Pages: 153 - 172
Exact 3-satisfiability is decidable in time O(20.16254n ) Stefan PorschenBert RanderathEwald Speckenmeyer OriginalPaper 31 December 2004 Pages: 173 - 193
A SAT approach to query optimization in mediator systems Steven PrestwichStéphane Bressan OriginalPaper 31 December 2004 Pages: 195 - 210
Probability logic and optimization SAT: The PSAT and CPA models Daniele Pretolani OriginalPaper 31 December 2004 Pages: 211 - 221
Generalizations of matched CNF formulas Stefan Szeider OriginalPaper 31 December 2004 Pages: 223 - 238
Toward leaner binary-clause reasoning in a satisfiability solver Allen Van Gelder OriginalPaper 31 December 2004 Pages: 239 - 253
On deciding subsumption problems Uwe EglyReinhard PichlerStefan Woltran OriginalPaper 31 December 2004 Pages: 255 - 294
Extension and equivalence problems for clause minimal formulae Hans Kleine BüningXishun Zhao OriginalPaper 31 December 2004 Pages: 295 - 306
The SAT2002 competition Laurent SimonDaniel Le BerreEdward A. Hirsch OriginalPaper 31 December 2004 Pages: 307 - 342
A parsimony tree for the SAT2002 competition Paul W. PurdomDaniel Le BerreLaurent Simon OriginalPaper 31 December 2004 Pages: 343 - 365