Skip to content

Research at St Andrews

Parallel heuristic search in Haskell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

M Cope, I Gent, Kevin Hammond

School/Research organisations

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.

Close

Details

Original languageEnglish
Title of host publicationTRENDS IN FUNCTIONAL PROGRAMMING, VOL 2
Place of PublicationOXFORD
PublisherINTELLECT LTD
Pages65-76
Number of pages12
ISBN (Print)1-84150-058-5
Publication statusPublished - 2000

    Research areas

  • PROPOSITIONAL PROVER

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Solving computational problems in the theory of word-representable graphs

    Akgün, Ö., Gent, I. P., Kitaev, S. & Zantema, H., 24 Feb 2019, In : Journal of Integer Sequences. 22, 2, 17 p., 19.2.5.

    Research output: Contribution to journalArticle

  2. A review of literature on parallel constraint solving

    Gent, I. P., Miguel, I. J., Nightingale, P. W., McCreesh, C., Prosser, P., Moore, N. & Unsworth, C., Sep 2018, In : Theory and Practice of Logic Programming. 18, 5-6, p. 725-758 34 p.

    Research output: Contribution to journalArticle

  3. A framework for constraint based local search using ESSENCE

    Akgun, O., Attieh, S. W. A., Gent, I. P., Jefferson, C. A., Miguel, I. J., Nightingale, P. W., Salamon, A. Z., Spracklen, P. & Wetter, J. P., 13 Jul 2018, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Lang, J. (ed.). International Joint Conferences on Artificial Intelligence, p. 1242-1248 7 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Complexity of n-Queens completion (extended abstract)

    Gent, I. P., Jefferson, C. A. & Nightingale, P. W., 13 Jul 2018, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Lang, J. (ed.). International Joint Conferences on Artificial Intelligence, p. 5608-5611 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. Metamorphic testing of constraint solvers

    Akgun, O., Gent, I. P., Jefferson, C. A., Miguel, I. J. & Nightingale, P. W., 2018, Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. Hooker, J. (ed.). Springer, p. 727-736 (Lecture Notes in Computer Science; vol. 11008).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

ID: 4509705