Improving Parallel Local Search for SAT - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Improving Parallel Local Search for SAT

Alejandro Arbelaez
  • Function : Author
  • PersonId : 856329
Youssef Hamadi
  • Function : Author
  • PersonId : 840368


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.
Fichier principal
Vignette du fichier
lion-sat.pdf (216.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00563775 , version 1 (07-02-2011)


  • 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⟩


185 View
233 Download


Gmail Facebook X LinkedIn More