A. A. Faustini and W. W. Wadge, An eductive interpreter for pLucid. Technical Report TR--006--86, Department of Computer Science, Arizona State University, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Execution of Temporal Logic Programs Using Dataflow.. - Zhang, Orgun (1994) (1 citation) (Correct)
.... rely on the underlying resolution type proof procedure for correctness [OW93] For efficiency, we must combine features of logic programming implementations (unification, backtracking) with features of dataflow implementations (associative memory, tagging) such as those of Lucid implementations [FW86]. The proposed execution model is in particular amenable to parallel implementations on multi processor architectures. 4. CHRONOLOG VIRTUAL MACHINE The execution model of Chronolog is built on an intermediate virtual machine, namely Chronolog virtual machine (CVM) CVM is represented by a set ....
....It is desirable to be able to reuse the previous computations and to avoid repeated and unnecessary evaluations of a temporal atom which needs to be reduced several times in different contexts. CHEM uses an associative memory, known as warehouse, to store the results of the previous computations [FW86], and as a means for communication between independent computations under context parallelism (Figure 2) Consider the example of the fib program, and we want to prove the goal first next(5) fib(N) If both of the atoms first next(3) fib(2) and first next(4) fib(3) are computed earlier and ....
[Article contains additional citation context not shown here]
A. A. Faustini and W. W. Wadge, An eductive interpreter for pLucid. Technical Report TR--006--86, Department of Computer Science, Arizona State University, 1986.
Chronolog Admits a Complete Proof Procedure - Orgun, Wadge (1993) (6 citations) Self-citation (Wadge) (Correct)
....for example, see [17, 12] Implementations of Chronolog(Z) rely on TiSLD resolution for correctness. For efficiency, we must combine features of logic programming implementations (unification, backtracking) with features of dataflow implementations (associative memory, tagging) such as those of [13]. Any computation initiated by a goal may require that some sub goals be proved more than once during the course of the computation due to the time dependent nature of the definitions of predicates in programs. Time dependencies may be backward or forward in time or a combination of both. ....
A. A. Faustini and W. W. Wadge. An eductive interpreter for pLucid. Technical Report TR-006-86, Department of Computer Science, Arizona State University, 1986.
GLU Implementation Architectures for Heterogeneous Systems - Jagannathan, Dodd (Correct)
No context found.
A.A. Faustini and W.W. Wadge. An eductive interpreter for pLucid. In Proceedings of the 1987 SIGPLAN Conference on Interpreters and Interpretive Techniques, pages 86--91, Minneapolis, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC