2009•Journal on Satisfiability Boolean Modeling and ComputationOpen access

ManySAT: a Parallel SAT Solver

Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs

Open full text 321 citations

Abstract

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 tuning and their lack of robustness. ManySAT uses

Open-access reader

About this research paper

What this paper is about

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 tuning and their lack of robustness. ManySAT uses

Why it matters

OpenAlex reports 321 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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 tuning and their lack of robustness. ManySAT uses

Key concepts: Parallel computing, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
ManySAT: a Parallel SAT Solver — Research Paper | ScholarLens