Path for AND-parallel execution of logic programs

An efficient backward execution method for AND-parallelism in logic programs is proposed. It is devised through a close examination of some relation over literals, which can be represented by paths in the data dependency graphs. The scheme is more efficient than other works in the sense that it perf...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 52; no. 4; pp. 191 - 199
Main Authors Lee, Su-Hyun, Kim, Do-Hyung, Choe, Kwang-Moo
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 25.11.1994
Elsevier Science
Elsevier Sequoia S.A
Subjects
AND parallelism
AND/OR Process Model
Applicative (logic) programming
Applied sciences
Computer programming
Computer science
Computer science; control theory; systems
Data dependency graph
Exact sciences and technology
Graphs
Logic
Parallel evaluation of logic programs
Parallel processing
Path
Programming theory
Studies
Theoretical computing
AND/OR Process Model
Path
Parallel evaluation of logic programs
Data dependency graph
AND parallelism
Applicative (logic) programming
Evaluation
Parallelism
Logical programming
Graph path
Application program
Online AccessGet full text

Cover

More Information
Summary:An efficient backward execution method for AND-parallelism in logic programs is proposed. It is devised through a close examination of some relation over literals, which can be represented by paths in the data dependency graphs. The scheme is more efficient than other works in the sense that it performs less unfruitful resetting (and consequently, canceling) operations. Its rationale is also intuitively clear and natural. Furthermore, the relevant analyses needed for the proposal are largely achieved at compile time, which alludes to actual efficiency.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(94)90126-0