2000 · 312 citations · 24 references
ComputingComputer ScienceAlgorithmsDatabasesInformation RetrievalBenchmarkingConstraint SatisfactionBenchmark DatasetsBoolean SatisfiabilityBoolean Satisfiability ProblemComplexity Of SatisfiabilitySatisfiabilitySatisfiability Problem
Abstract. SATLIB is an online resource for SAT-related research established in June 1998. Its core components, a benchmark suite of SAT instances and a collection of SAT solvers, aim to facilitate empirical research on SAT by providing a uniform test-bed for SAT solvers along with freely available implementations of high-performing SAT algorithms. In this article, we give an overview of SATLIB; in particular, we describe its current set of benchmark problems. Currently, the main SATLIB web site
24
A new method for solving hard satisfiability problems
Bart Selman, Hector J. Levesque, David G. M. Mitchell · 1992 · 1.2K citations
Noise strategies for improving local search
Bart Selman, Henry Kautz, Brain Cohen · 1994 · 761 citations