We propose the architecture of a novel distributed SAT solver, which is composed of a control unit (CU) and multiple implication units (IU). In this model, CU handles the control-intensive tasks such as clause partitioning, decision and backtracking, and IUs process implications, which are computation-intensive. This model has been modeled with SystemC successfully and simulation results show that it has the potential to get>35 speedup compared to software solvers, and moreover, it doesn’t need to re-compile implication circuits for different instances, in contrast to other hardware SAT solvers. 1
Our goal is to develop techniques for using distributed computing re- sources to efficiently solve in...
• Software engineering (SE) problems reduced to logic problems • Automation, engineering, usability ...
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algo...
Abstract. Parallelization of unit propagation in SAT solvers is a com-pelling way of obtaining an ef...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
Creating an effective parallel SAT solver is known to be a challenging task. At present, the most ef...
Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-...
Abstract—Most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running...
In this paper we present a parallel prover for the propositional satisfiability problem called PICHA...
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT ...
This tutorial will present an overview of parallelism in SAT. It will start with a presentation of c...
Many SAT instances can be decomposed into connected components either initially after preprocessing ...
ii The Boolean satisfiability (SAT) problem is central to many applications involving the verificati...
Abstract. Solvers for propositional logic formulas, so called SAT solvers, are used in many practica...
Abstract—This paper introduces a novel approach for solving the Boolean satisfiability (SAT) problem...
Our goal is to develop techniques for using distributed computing re- sources to efficiently solve in...
• Software engineering (SE) problems reduced to logic problems • Automation, engineering, usability ...
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algo...
Abstract. Parallelization of unit propagation in SAT solvers is a com-pelling way of obtaining an ef...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
Creating an effective parallel SAT solver is known to be a challenging task. At present, the most ef...
Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-...
Abstract—Most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running...
In this paper we present a parallel prover for the propositional satisfiability problem called PICHA...
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT ...
This tutorial will present an overview of parallelism in SAT. It will start with a presentation of c...
Many SAT instances can be decomposed into connected components either initially after preprocessing ...
ii The Boolean satisfiability (SAT) problem is central to many applications involving the verificati...
Abstract. Solvers for propositional logic formulas, so called SAT solvers, are used in many practica...
Abstract—This paper introduces a novel approach for solving the Boolean satisfiability (SAT) problem...
Our goal is to develop techniques for using distributed computing re- sources to efficiently solve in...
• Software engineering (SE) problems reduced to logic problems • Automation, engineering, usability ...
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algo...