Approaches to efficient execution of logic programs (original) (raw)

1990

Abstract

Execution efficiency of logic programs can be improved in two major directions: parallel processing for more computation power and control guidance for less non-determinism. Parallel execution of a logic program represented in connection graph has to be guarded against the problems of logical inconsistency. Enforcing Bernstein conditions can prevent such problems but results in an unacceptable reduction of parallelism. A subcycle-level parallel procedure with step-wise purity deletions is designed to remedy such problems. The concurrent step-wise purity deletion has been shown to preserve much of the deletion power of the sequential purity deletion. Recursion is what makes a logic program non-trivial. Fact propagation is proposed to reduce the run-time recursive interation by a compile-time analysis of the recursive loops. Herbrand expansion tree provide a concise organization for the increasingly large number of unit clauses during the propagation. Symbolic execution through the lo...

Ting-Lu Huang hasn't uploaded this paper.

Let Ting-Lu know you want this paper to be uploaded.

Ask for this paper to be uploaded.