Year: 1988
Type: conference-paper
Abstract: This paper is concerned with the issue of parallel evaluation of logic programs. To address this issue we define a new concept of predicate decomposability. If a predicate is decomposable, it means that the load of evaluating it can be divided among a number of processors, without a need for communication among them. This in turn results in a very significant speed-up of the evaluation process.
DOI: 10.1145/50202.50242
Authors: Ouri Wolfson, Avi Silberschatz
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: distributed logic programming, speedup
Open Access status: bronze
OpenAlex ID: W4243744698
