Add to ORKGAbstract: We report on a case study of implementing parallel variants of the Davis-Putnam-Logemann-Loveland algorithm for solving the SAT problem of propositional formulas in the functional programming language Haskell. We explore several state of the art programming techniques for parallel and concurrent programming in Haskell and provide the corresponding implementations. Based on our experimental results, we compare several approaches and implementations.
Current parallel SAT solvers suffer from a non-deterministic behavior. This is the consequence of th...
We describe the design and implementation of a highly optimized, multithreaded algorithm for the pro...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...
It has often been suggested that functional languages provide an excellent basis for programming par...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
New areas of applications make the world of supercomputing more important than ever before. The prog...
In this dissertation, we examine variations of the DPLL algorithm, a popular algorithm for solving t...
Even though concurrent programming has been a hot topic of discussion in Computer Science for the pa...
Abstract. Due to the inherent NP-completeness of SAT, many SAT problems currently cannot be solved i...
AbstractEven though concurrent programming has been a hot topic of discussion in Computer Science fo...
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describe...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thin...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...
AbstractWe describe the design and implementation of a highly optimized, multithreaded algorithm for...
Current parallel SAT solvers suffer from a non-deterministic behavior. This is the consequence of th...
We describe the design and implementation of a highly optimized, multithreaded algorithm for the pro...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...
It has often been suggested that functional languages provide an excellent basis for programming par...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
New areas of applications make the world of supercomputing more important than ever before. The prog...
In this dissertation, we examine variations of the DPLL algorithm, a popular algorithm for solving t...
Even though concurrent programming has been a hot topic of discussion in Computer Science for the pa...
Abstract. Due to the inherent NP-completeness of SAT, many SAT problems currently cannot be solved i...
AbstractEven though concurrent programming has been a hot topic of discussion in Computer Science fo...
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describe...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thin...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...
AbstractWe describe the design and implementation of a highly optimized, multithreaded algorithm for...
Current parallel SAT solvers suffer from a non-deterministic behavior. This is the consequence of th...
We describe the design and implementation of a highly optimized, multithreaded algorithm for the pro...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...