Making Exhaustive Search Programs Deterministic, Part II (0)
Cached
Download Links
- [www.ueda.info.waseda.ac.jp]
- [www.ueda.info.waseda.ac.jp]
- DBLP
Other Repositories/Bibliography
| Venue: | New Generation Computing |
| Citations: | 18 - 4 self |
BibTeX
@INPROCEEDINGS{Ueda_makingexhaustive,
author = {Kazunori Ueda},
title = {Making Exhaustive Search Programs Deterministic, Part II},
booktitle = {New Generation Computing},
year = {},
pages = {270--282},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper complements the previous paper \Making Exhaustive Search Programs Deterministic" which showed a systematic method for compiling a Horn-clause program for exhaustive search into a GHC program or a Prolog program with no backtracking. This time we present a systematic method for deriving a deterministic logic program that simulates coroutining execution of a generate-and-test logic program. The class of compilable programs is suciently general, and compiled programs proved to be ecient. The method can also be viewed as suggesting a method of compiling a naive logic program into (very) low-level languages.
