Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

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 …

SAT solving in large distributed environments has previously led to some famous results and
to impressive speedups for selected inputs. However, in terms of general-purpose SAT …

The recent successes of SAT solvers in traditional hardware and software applications have
extended to important new domains. Today, they represent essential low-level reasoning …

The parallel computing power offered by graphic processing units (GPUs) has been recently
exploited to support general purpose applications–by exploiting the availability of general …

This paper describes the multithreaded MiraXT SAT solver which was designed to take
advantage of current and future shared memory multiprocessor systems. The paper …

In this paper we study the problem of solving hard propositional satisfiability problem (SAT)
instances in a computing grid or cloud, where run times and communication between …

This article describes PaMiraXT, a powerful parallel SAT algorithm. PaMiraXT follows a
master/client model based on message passing, making it suitable for any kind of …

In this paper, we explore the two well-known principles of diversification and intensification
in portfolio-based parallel SAT solving. These dual concepts play an important role in …

The emerging large-scale computational grid infrastructure is providing an interesting
platform for massive distributed computations. In this paper a novel distribution method …