Berger, TillSabel, DavidWagner, StefanLichter, Horst2018-10-242018-10-242013978-3-88579-609-1https://dl.gi.de/handle/20.500.12116/17393We 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.enText/Conference Paper1617-5468