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.
| Original language | English |
|---|---|
| Title of host publication | TRENDS IN FUNCTIONAL PROGRAMMING, VOL 2 |
| Place of Publication | OXFORD |
| Publisher | Intellect Ltd. |
| Pages | 65-76 |
| Number of pages | 12 |
| ISBN (Print) | 1-84150-058-5 |
| Publication status | Published - 2000 |
Keywords
- PROPOSITIONAL PROVER