ManySAT: a Parallel SAT Solver
Author(s) -
Youssef Hamadi,
Saïd Jabbour,
Lakhdar Saïs
Publication year - 2009
Publication title -
journal on satisfiability boolean modeling and computation
Language(s) - English
Resource type - Journals
eISSN - 1875-5011
pISSN - 1574-0617
DOI - 10.3233/sat190070
Subject(s) - parallel computing , computer science
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 a portfolio of complementary sequential algorithms obtained through careful variations of the standard DPLL algorithm. Additionally, each sequential algorithm shares clauses to improve the overall performance of the whole system. This contrasts with most of the parallel SAT solvers generally designed using the divide-and-conquer paradigm. Experiments on many industrial SAT instances, and the first rank obtained by ManySAT in the parallel track of the 2008 SAT-Race clearly show the potential of our design philosophy.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom