Visualization of And/Or-Parallel Execution of Logic Programs
Rick Vaupel, Enrico Pontelli, Gopal Gupta · The MIT Press eBooks · 1997
In this paper we consider the problem of designing a graphical tool for visualizing and-or parallel execution. We rst present a paradigm for visualizing and-or parallel execution. This paradigm is based on an abstract representation of and-or parallel execution called the recomputation tree. We present a general purpose, interactive, both static and animated, tool called VACE that realizes this paradigm. Interesting features of VACE and their implementation are discussed. 1 Introduction An important property of logic programming languages is that they are declarative, allowing for parallelism to be exploited implicitly during their execution. That is, parallelism can be exploited without requiring any help from the programmer. Three broad types of (implicit) parallelism have been identied in logic programs: (i) Or-parallelism: arises when multiple clauses dene some predicate and a goal unies with more than one clause head| the corresponding bodies can then be executed in or-paral...