Portfolio-based Parallel SAT solving

In this talk we present several contributions to Parallel SAT solving. First, we overview some of the recent work on parallel SAT, then we introduce the portfolio-based parallel framework and discuss its main pros. and cons. Secondly, we address the clause sharing issue, and we describe a novel approach for dynamically controlling the overall exchange between the computing units. Finally, we compare the two main approaches for parallel SAT: the classical divide and conquer and portfolio based parallel models.