PSATO: a distributed propositional prover and its application to quasigroup problems
Journal of Symbolic Computation - Special issue on parallel symbolic computation
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A machine program for theorem-proving
Communications of the ACM
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
An Efficient Approach to Solving Random k-sat Problems
Journal of Automated Reasoning
ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
Aiding side-channel attacks on cryptographic software with satisfiability-based analysis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
International Journal of Computational Science and Engineering
JaCk-SAT: a new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A collaborative approach for multi-threaded SAT solving
International Journal of Parallel Programming
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
| Hi-index | 0.00 |
The boolean satisfiability problem SAT is a well-known NP-Complete problem, which is widely studied because of its conceptualsimplicity. Nowadays the number of existing parallel SAT solvers is quitesmall. Furthermore, they are generally designed for large clusters usingthe message passing paradigm. These solvers are coarse grained applicationsince they divide the search-tree among the processors avoiding communicationand synchronization. In this paper mtss, for Multi ThreadedSat Solver, is introduced. It is a fine grain parallel sat solver, in sharedmemory. It defines a rich thread in charge of the search-tree evaluationand a set of poor threads that will help the rich one by simplifying theopened node. mtss is well designed for multi-core CPU since it reducesthe memory allocation during the search.