Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running several times the same solver with different parameters. In this paper, we propose a tool called Dolius, mainly based on the divide and conquer paradigm. In contrast to most current parallel efficient engines, Dolius does not need shared memory, can be distributed, and scales well when a large number of computing units is available. Furthermore, our tool contains an API allowing to plug any SAT solver in a simple way.
International audienceWe are interested in this work in solving efficiently a set of instances of th...
Boolean SATisfiability has been used successfully in many applicative contexts. This is due to the ...
Effectively parallelizing SAT solving is an open and important issue. The current state-of-the-art i...
Abstract—Most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running...
International audienceOver the last decade, parallel SAT solving has been widelystudied from both th...
International audienceOver the last decade, parallel SAT solving has been widelystudied from both th...
International audienceOver the last decade, parallel SATisfiability solving has been widely studied ...
This tutorial will present an overview of parallelism in SAT. It will start with a presentation of c...
Creating an effective parallel SAT solver is known to be a challenging task. At present, the most ef...
Nowadays, powerful parallel SAT solvers are based on an algorithm portfolio. The alternative approac...
Abstract. Due to the inherent NP-completeness of SAT, many SAT problems currently cannot be solved i...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT ...
International audienceWe are interested in this work in solving efficiently a set of instances of th...
International audienceWe are interested in this work in solving efficiently a set of instances of th...
Boolean SATisfiability has been used successfully in many applicative contexts. This is due to the ...
Effectively parallelizing SAT solving is an open and important issue. The current state-of-the-art i...
Abstract—Most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running...
International audienceOver the last decade, parallel SAT solving has been widelystudied from both th...
International audienceOver the last decade, parallel SAT solving has been widelystudied from both th...
International audienceOver the last decade, parallel SATisfiability solving has been widely studied ...
This tutorial will present an overview of parallelism in SAT. It will start with a presentation of c...
Creating an effective parallel SAT solver is known to be a challenging task. At present, the most ef...
Nowadays, powerful parallel SAT solvers are based on an algorithm portfolio. The alternative approac...
Abstract. Due to the inherent NP-completeness of SAT, many SAT problems currently cannot be solved i...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT ...
International audienceWe are interested in this work in solving efficiently a set of instances of th...
International audienceWe are interested in this work in solving efficiently a set of instances of th...
Boolean SATisfiability has been used successfully in many applicative contexts. This is due to the ...
Effectively parallelizing SAT solving is an open and important issue. The current state-of-the-art i...