Clustering and Partition Based Divide and Conquer for SAT Solving

Author(s):  
Quanrun Fan ◽  
Zhenhua Duan ◽  
Cong Tian ◽  
Hongwei Du
10.29007/44vf ◽  
2018 ◽  
Author(s):  
Youssef Hamadi

This tutorial will present an overview of parallelism in SAT. It will start with a presentation of classical divide and conquer techniques, discuss their ancient origin and compare them to more recent portfolio- based algorithms. It will then present the impact of clause-sharing on their performances and discuss various strategies used to control the communication overhead. A particular technique used to control the classical diversification/intensification tradeoff will also be presented. Finally, perspectives will be given which will relate the current parallel SAT technologies to the expected evolution of computational platforms, leading to distributed SAT solving scenarios.


10.29007/hvqt ◽  
2018 ◽  
Author(s):  
Gilles Audemard ◽  
Benoît Hoessen ◽  
Saïd Jabbour ◽  
Cédric Piette

Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running several times the same solver with different parameters. In this paper, we propose a tool called Dolius, mainly based on the divide and conquer paradigm. In contrast to most current parallel efficient engines, Dolius does not need shared memory, can be distributed, and scales well when a large number of computing units is available. Furthermore, our tool contains an API allowing to plug any SAT solver in a simple way.


2011 ◽  
Vol 36 (12) ◽  
pp. 1697-1705 ◽  
Author(s):  
Rong-Chuan SUN ◽  
Shu-Gen MA ◽  
Bin LI ◽  
Ming-Hui WANG ◽  
Yue-Chao WANG
Keyword(s):  

2014 ◽  
Vol 12 (2) ◽  
pp. 124-130 ◽  
Author(s):  
Cosme Santiesteban-Toca ◽  
Gerardo Casanola-Martin ◽  
Jesus Aguilar-Ruiz

Sign in / Sign up

Export Citation Format

Share Document