Improving Parallel Local Search for SAT

  title={Improving Parallel Local Search for SAT},
  author={Alejandro Arbelaez and Youssef Hamadi},
  booktitle={Learning and Intelligent Optimization},
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… 

Parallel Local Search for Satisfiability

This chapter studies the impact of knowledge sharing on the performance of portfolio-based parallel local search algorithms, which aggregates the shared knowledge to carefully craft a new starting point at each restart point.

From Sequential to Parallel Local Search for SAT

An empirical study is presented that suggests that the best sequential solver is not necessary the one with the overall best parallel speedup, and that on different problem families the behaviors of different solvers vary greatly.

Cooperative Parallel SAT Local Search with Path Relinking

An empirical study is presented that suggest that path relinking outperforms a set of well-known parallel portfolio-based local search algorithms with and without cooperation.

Massively Parallel Local Search for SAT

  • A. ArbelaezP. Codognet
  • Computer Science
    2012 IEEE 24th International Conference on Tools with Artificial Intelligence
  • 2012
This work studies the performance of parallel local search for SAT with a large degree of parallelism, up to 256 cores, and compares various cooperation strategies.

Towards Massively Parallel Local Search for SAT - (Poster Presentation)

Parallel portfolio-based algorithms have become a standard methodology for building parallel algorithms for SAT and strategies range from a voting mechanism where each algorithm in the portfolio suggests a value for each variable to probabilistic constructions.

Parallel Tree Search for Satisfiability

ManySAT is described, a portfolio-based parallel SAT solver which runs a set of complementary sequential algorithms obtained through careful variations of the standard CDCL algorithm which shares clauses to improve the overall performance of the whole system.

An overview of parallel SAT solving

This paper presents an overview of parallel SAT solving, namely, different approaches and a variety of clause sharing strategies, and an evaluation of multicore SAT solvers is presented, showing the evolution of multicores over the last years.

A review of literature on parallel constraint solving

There seems to be little overall guidance that can be given on how best to exploit multi-core computers to speed up constraint solving, and it is hoped that this survey will provide useful pointers to future researchers wishing to correct this situation.

Seven Challenges in Parallel SAT Solving

This paper provides a broad overview of the situation in the area of Parallel Search with a specific focus on Parallel SAT Solving. A set of challenges to researchers is presented which, we

Estimating parallel runtimes for randomized algorithms in constraint solving

A framework to estimate the parallel performance of a given algorithm by analyzing the runtime behavior of its sequential version by approximating the runtime distribution of the sequential process with statistical methods is proposed.



ManySAT: a Parallel SAT Solver

In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter

Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances

A technique for checking instances of the satisfiability (SAT) problem based on a combination of the Davis-Putnam (DP) procedure and stochastic methods that is proven to be efficient for several types of SAT instances.

Local Search Algorithms for SAT: An Empirical Evaluation

This article presents a detailed comparative analysis of two particularly well-known families of local search algorithms for SAT, the GSAT and WalkSAT architectures, using a benchmark set that contains instances from randomized distributions as well as SAT-encoded problems from various domains.

Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems

This work presents three strategies that dramatically improve GSAT's performance on formulas with a high degree of asymmetry, thereby significantly extending the applicability of the GSAT algorithm.

Criticality and Parallelism in Structured SAT Instances

It is shown that also for structured instances there exists an optimal value of parallelism which enables the algorithm to reach the optimal performance and, by analyzing the frequency of node degree of the graphs associated with the SAT instances, it is observed that an asymmetric and not regular distribution strongly affects the algorithmp erformance with respect to the parallelism.

Propositional Satisfiability and Constraint Programming: A comparative survey

This survey overviews the two areas of Propositional Satisfiability and Constraint Programming in a comparative way, emphasizing the similarities and differences between the two and the points where one technology can benefit from ideas or experience acquired from the other.

A New Method for Solving Hard Satisfiability Problems

A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.

Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT

Scaling and Probabilistic Smoothing (SAPS), an efficient SAT algorithm that is conceptually closely related to ESG, is developed, and a reactive version of SAPS (RSAPS) is introduced that adaptively tunes one of the algorithm's important parameters.

Diversification and Determinism in Local Search for Satisfiability

This paper proposes a diversification parameter for Novelty (or R-Novelty) heuristic to break the determinism in Novelty and shows its performance compared with the random walk parameter in novels and exploits promising decreasing paths in a deterministic fashion in local search using a gradient-based approach.

Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem

An asynchronous cooperative local search approach in which a population of local search threads cooperate asynchronously to find better solutions is developed, and four single-solution metaheuristics are extended to population-based variants using the asynchronous cooperative mechanism.