Parallel heuristic search in Haskell

Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming language Haskell suggest that modest real speedup can be achieved for the most interesting hard search cases.

• Type: Conference
• Year: 2000
• Where: SFP
• Authors: Michelle Cope, Ian P. Gent, Kevin Hammond
• Keywords: GpH Parallel Dialect, Parallel Heuristic Search, Search Algorithms, SFP 2000, SFP 2001