A More Efficient Parallel Unit Propagation


This work extends early work about parallel unit propagation in SAT solvers. Since CSP solvers use SAT solvers as backend, parallel solving ships with parallel SAT solvers. The parallelization is based on splitting the formula into partitions. Each thread will propagate all literals only on its private partition and communicates the found implied literals… (More)


3 Figures and Tables

Cite this paper

@inproceedings{Manthey2011AME, title={A More Efficient Parallel Unit Propagation}, author={Norbert Manthey}, year={2011} }