Work

Distributed processing of logic programs

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.
Language: English
Open Access status: bronze
OpenAlex ID: W4243744698
FWCI: 3.358
Cites: 14
Cited by: 47
Related to: 10