Making exhaustive search programs deterministic
type: Item
instance of: scholarly article
title: Making exhaustive search programs deterministic
zbMATH Open document ID: 0631.68074
DOI: 10.1007/BF03037456
author: Kazunori Ueda
published in: New Generation Computing
publication date: 1987-01-01T00:00:00Z
review text: This paper presents a technique for compiling a Horn-clause program intended for exhaustive search into a GHC (Guarded Horn Clauses) program. The technique can be viewed also as a transformation technique for Prolog programs which compiles away the `bagof' primitive and non-determinate bindings. The class of programs to which our technique is applicable is shown with a static checking algorithm; it is nontrivial and could be extended. An experiment on a compiler-based Prolog system showed that our technique improved the efficiency of exhaustive search by 6 times for a permutation generator program. This compilation technique is important also in that it exploits the AND-parallelism of GHC for parallel search.
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 4026860
zbMATH Keywords: multiple binding environments
zbMATH Keywords: compilation
zbMATH Keywords: program transformation
zbMATH Keywords: parallelism
zbMATH Keywords: Horn-clause program
zbMATH Keywords: exhaustive search
zbMATH Keywords: Prolog programs
describes a project that uses: PARLOG
describes a project that uses: GHC
MaRDI profile type: Publication
cites work: PARLOG: parallel programming in logic
cites work: Notes on the implementation of PARLOG
cites work: Q3339245
cites work: Q3994465
cites work: Q3805880
description: scientific article; zbMATH DE number 4026860