| dc.contributor.author | Berger, Till | |
| dc.contributor.author | Sabel, David | |
| dc.contributor.editor | Wagner, Stefan | |
| dc.contributor.editor | Lichter, Horst | |
| dc.date.accessioned | 2018-10-24T10:00:13Z | |
| dc.date.available | 2018-10-24T10:00:13Z | |
| dc.date.issued | 2013 | |
| dc.identifier.isbn | 978-3-88579-609-1 | |
| dc.identifier.issn | 1617-5468 | |
| dc.identifier.uri | http://dl.gi.de/handle/20.500.12116/17393 | |
| dc.description.abstract | 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. | en |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2013 - Workshopband | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-215 | |
| dc.title | Parallelizing DPLL in Haskell | en |
| dc.type | Text/Conference Paper | |
| dc.pubPlace | Bonn | |
| mci.reference.pages | 27-42 | |
| mci.conference.sessiontitle | Regular Research Papers | |
| mci.conference.location | Aachen | |
| mci.conference.date | 26. Februar-1. März 2013 | |
