Parallel heuristic search in Haskell

M  Cope; I  Gent; Kevin Hammond

Parallel heuristic search in Haskell

M Cope, I Gent, Kevin Hammond

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

Cite this

@inproceedings{020bfdbf55024d4ebdc9979d90455ec9,

title = "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.",

keywords = "PROPOSITIONAL PROVER",

author = "M Cope and I Gent and Kevin Hammond",

year = "2000",

language = "English",

isbn = "1-84150-058-5",

pages = "65--76",

booktitle = "TRENDS IN FUNCTIONAL PROGRAMMING, VOL 2",

publisher = "Intellect Ltd.",

address = "United Kingdom",

}

TY - GEN

T1 - Parallel heuristic search in Haskell

AU - Cope, M

AU - Gent, I

AU - Hammond, Kevin

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - PROPOSITIONAL PROVER

M3 - Conference contribution

SN - 1-84150-058-5

SP - 65

EP - 76

BT - TRENDS IN FUNCTIONAL PROGRAMMING, VOL 2

PB - Intellect Ltd.

CY - OXFORD

ER -

Parallel heuristic search in Haskell

Abstract

Keywords

Fingerprint

Cite this