Journal on Satisfiability Boolean Modeling and Computation · 2009 · 313 citations · 25 references
ComputingComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingConstraint SatisfactionData ParallelismParallel ArchitecturesParallel Computing SystemsParallel Solvers
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses
25
A machine program for theorem-proving
Martin Davis, George Logemann, Donald Loveland · Communications of the ACM · 1962 · 3.2K citations · Full text
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
GRASP - A New Search Algorithm for Satisfiability
1996 · 860 citations
Solving SAT and SAT Modulo Theories
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli · Journal of the ACM · 2006 · 777 citations
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
2001 · 666 citations