Technical reports
Automatic exploitation of OR-parallelism in Prolog
Carole Klein
September 1992, 18 pages
DOI: 10.48456/tr-266
Abstract
A path through a search space can be defined by a sequence of integers called an oracle. The Delphi machine consists of a network of individual workstations co-operating to execute a Prolog program. Using oracles, these machines automatically partition the search space between them, thereby exploiting OR-parallelism. This report provides a brief description of the tree-searching algorithms (control strategies) implemented in the Delphi machine.
Full text
PDF (0.8 MB)
BibTeX record
@TechReport{UCAM-CL-TR-266, author = {Klein, Carole}, title = {{Automatic exploitation of OR-parallelism in Prolog}}, year = 1992, month = sep, url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-266.pdf}, institution = {University of Cambridge, Computer Laboratory}, doi = {10.48456/tr-266}, number = {UCAM-CL-TR-266} }