Parallelizing DPLL in Haskell

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.
  • Citation
  • BibTeX
Berger, T. & Sabel, D., (2013). Parallelizing DPLL in Haskell. In: Wagner, S. & Lichter, H. (Hrsg.), Software Engineering 2013 - Workshopband. Bonn: Gesellschaft für Informatik e.V.. (S. 27-42).
@inproceedings{mci/Berger2013,
author = {Berger, Till AND Sabel, David},
title = {Parallelizing DPLL in Haskell},
booktitle = {Software Engineering 2013 - Workshopband},
year = {2013},
editor = {Wagner, Stefan AND Lichter, Horst} ,
pages = { 27-42 },
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
27.pdf183.4Kb PDF View/Open

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Send Feedback

More Info

ISBN: 978-3-88579-609-1
ISSN: 1617-5468
xmlui.MetaDataDisplay.field.date: 2013
Language: en (en)
Content Type: Text/Conference Paper
Collections

Show full item record