Making exhaustive search programs deterministic

研究成果: Conference contribution

7 被引用数 (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
ホスト出版物のタイトル3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings
出版社Springer-Verlag
ページ270-282
ページ数13
ISBN(印刷版)9783540164920
DOI
出版ステータスPublished - 1986 1 1
外部発表はい
イベント3rd International Conference on Logic Programming, ICLP 1986 - London, United Kingdom
継続期間: 1986 7 141986 7 18

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
225 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other3rd International Conference on Logic Programming, ICLP 1986
CountryUnited Kingdom
CityLondon
Period86/7/1486/7/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Making exhaustive search programs deterministic」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル