Making exhaustive search programs deterministic

研究成果: Article

13 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)29-44
ページ数16
ジャーナルNew Generation Computing
5
発行部数1
DOI
出版物ステータスPublished - 1987 3 1

    フィンガープリント

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications

これを引用