There is quite a bit of work on parallelising SAT solving, as it's one of the most important algorithmic problems, both in theory and in practise, but (as far a

There is quite a bit of work on parallelising SAT solving, as it's one of the most important algorithmic problems, both in theory and in practise, but (as far as I'm aware) the top sequential algorithms still beat parallel solvers. The most successful approach at this point seems to be Cube-and-Conquer [1], but I don't think this is considered a good approach in itself. There is a huge amount of scope for new ideas. I doubt that anything naive will work, as SAT solving is a rather competitive research field. The annual SAT competition http://www.satcompetition.org http://www.satcompetition.org has a track for parallel solving. See [2, 3, 4] for an overview of the field. [1] M. J. H. Heule, O. Kullmann, S. Wieringa, A. Biere, Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. [2] S. Hölldobler, N. Manthey, V. H. Nguyen, J. Stecklina, P. Steinke, A Short Overview on Modern Parallel SAT-Solvers. [3] S. Wieringa, K. Heljanko, Asynchronous Multi-Core Incremental SAT Solving. [4] Y. Hamadi, C. M. Wintersteiger, Seven Challenges in Parallel SAT Solving.