GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Predicting learnt clauses quality in modern SAT solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Control-based clause sharing in parallel SAT solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A lightweight component caching scheme for satisfiability solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On freezing and reactivating learnt clauses
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Grid-based SAT solving with iterative partitioning and clause learning
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Soundness of inprocessing in clause sharing SAT solvers
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Concurrent clause strengthening
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
Managing learnt clause database is known to be a tricky task in SAT solvers. In the portfolio framework, the collaboration between threads through learnt clause exchange makes this problem even more difficult to tackle. Several techniques have been proposed in the last few years, but practical results are still in favor of very limited collaboration, or even no collaboration at all. This is mainly due to the difficulty that each thread has to manage a large amount of learnt clauses generated by the other workers. In this paper, we propose new efficient techniques for clause exchanges within a parallel SAT solver. In contrast to most of the current clause exchange methods, our approach relies on both export and import policies, and makes use of recent techniques that proves very effective in the sequential case. Extensive experimentations show the practical interest of the proposed ideas.