Making exhaustive search programs deterministic

Kazunori Ueda

doi:10.1007/3-540-16492-8_81

Making exhaustive search programs deterministic

Kazunori Ueda

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

7 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings
Publisher	Springer-Verlag
Pages	270-282
Number of pages	13
ISBN (Print)	9783540164920
DOIs	https://doi.org/10.1007/3-540-16492-8_81
Publication status	Published - 1986 Jan 1
Externally published	Yes
Event	3rd International Conference on Logic Programming, ICLP 1986 - London, United Kingdom Duration: 1986 Jul 14 → 1986 Jul 18

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	225 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Conference on Logic Programming, ICLP 1986
Country	United Kingdom
City	London
Period	86/7/14 → 86/7/18

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-16492-8_81

Fingerprint Dive into the research topics of 'Making exhaustive search programs deterministic'. Together they form a unique fingerprint.

Cite this

Ueda, K. (1986). Making exhaustive search programs deterministic. In 3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings (pp. 270-282). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 225 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-16492-8_81

Making exhaustive search programs deterministic. / Ueda, Kazunori.

3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings. Springer-Verlag, 1986. p. 270-282 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 225 LNCS).

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

Ueda, K 1986, Making exhaustive search programs deterministic. in 3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 225 LNCS, Springer-Verlag, pp. 270-282, 3rd International Conference on Logic Programming, ICLP 1986, London, United Kingdom, 86/7/14. https://doi.org/10.1007/3-540-16492-8_81

Ueda K. Making exhaustive search programs deterministic. In 3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings. Springer-Verlag. 1986. p. 270-282. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-16492-8_81

@inproceedings{338ce9b7119a4fb1b8d6ba2facf116e0,

title = "Making exhaustive search programs deterministic",

abstract = "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 {\textquoteleft}bagof{\textquoteright} 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.",

author = "Kazunori Ueda",

year = "1986",

month = jan,

day = "1",

doi = "10.1007/3-540-16492-8_81",

language = "English",

isbn = "9783540164920",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "270--282",

booktitle = "3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings",

note = "3rd International Conference on Logic Programming, ICLP 1986 ; Conference date: 14-07-1986 Through 18-07-1986",

}

TY - GEN

T1 - Making exhaustive search programs deterministic

AU - Ueda, Kazunori

PY - 1986/1/1

Y1 - 1986/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=85027527854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027527854&partnerID=8YFLogxK

U2 - 10.1007/3-540-16492-8_81

DO - 10.1007/3-540-16492-8_81

M3 - Conference contribution

AN - SCOPUS:85027527854

SN - 9783540164920

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 270

EP - 282

BT - 3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings

PB - Springer-Verlag

T2 - 3rd International Conference on Logic Programming, ICLP 1986

Y2 - 14 July 1986 through 18 July 1986

ER -

Making exhaustive search programs deterministic

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this