PSATO: a distributed propositional prover and its application to quasigroup problems
Journal of Symbolic Computation - Special issue on parallel symbolic computation
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Journal of Automated Reasoning
ZetaSAT - Boolean SATisfiability solving on Desktop Grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
PaMira - A Parallel SAT Solver with Knowledge Sharing
MTV '05 Proceedings of the Sixth International Workshop on Microprocessor Test and Verification
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Strategies for Solving SAT in Grids by Randomized Search
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
A distribution method for solving SAT in grids
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
c-sat: A Parallel SAT Solver for Clusters
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, known to yield significant speed-ups in the sequential case, in such a distributed framework. The approach exploits existing state-of-the-art clause learning SAT solvers by embedding them with virtually no modifications. We show that for many industrial SAT instances, the expected run time can be decreased by carefully combining the learned clauses from the distributed solvers. We compare different parallel learning strategies by using a representative set of benchmarks, and exploit the results to devise an algorithm for learning-enhanced randomized SAT solving in Grid environments. Finally, we experiment with an implementation of the algorithm in a production level Grid and solve several problems which were not solved in the SAT 2007 solver competition.