Skip to Main content Skip to Navigation
Conference papers

Improving Parallel Local Search for SAT

Abstract : In this work, our objective is to study the impact of knowledge sharing on the performance of portfolio-based parallel local search algorithms. Our work is motivated by the demonstrated importance of clause-sharing in the performance of complete parallel SAT solvers. Unlike complete solvers, state-of-the-art local search algorithms for SAT are not able to generate redundant clauses during their execution. In our settings, each member of the portfolio shares its best configuration (i.e., one which minimizes conflicting clauses) in a common structure. At each restart point, instead of classically generating a random configuration to start with, each algorithm aggregates the shared knowledge to carefully craft a new starting point. We present several aggregation strategies and evaluate them on a large set of problems.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Alejandro Arbelaez Connect in order to contact the contributor
Submitted on : Monday, February 7, 2011 - 11:39:20 AM
Last modification on : Monday, February 7, 2011 - 11:52:26 AM
Long-term archiving on: : Sunday, May 8, 2011 - 3:26:13 AM


Files produced by the author(s)


  • HAL Id : inria-00563775, version 1



Alejandro Arbelaez, Youssef Hamadi. Improving Parallel Local Search for SAT. Learning and Intelligent OptimizatioN Conference LION5, Jan 2011, Rome, Italy. ⟨inria-00563775⟩



Record views


Files downloads