E. Pontelli and G. Gupta. On the duality between or-parallelism and and-parallelism in logic programming. Lecture Notes in Computer Science, 966:43{??, 1995.  Home/Search   Document Details and Download   Summary   Related Articles

....for an ecient implementation of IAP. Ultimately, we aim at a novel IAP proposal that can be naturally extended to support ORP through the SBA [3] or other approaches, such as the COWL [16] The key ideas in our design will be (i) to always take advantage of the analogy between ORP and IAP [14]; ii) to avoid creating new structures by re utilizing WAM data structures wherever possible; and (iii) to avoid major changes to the compiler. We shall assume that the underlying system is WAM based [20] like YAP [5, 17] Next we propose our model in a stepwise fashion, starting from the ....

....is written to the left of g j . The no slowdown rule is guaranteed when g j can only execute if g i is actively executing or if it has executed. The no slowdown rule can be seen as an analogue of the sequential exploitation of alternatives in ORP (see Pontelli and Gupta for an in depth discussion [14]) Moreover, the parallel conjunction represents a subset of a clause s body, which is represented as an environment in the WAM [20] Clearly, this begs the question: why not represent parallel execution within an environment. We shall thus de ne next the rst implementation principle for our ....

E. Pontelli and G. Gupta. On the duality between or-parallelism and and-parallelism in logic programming. Lecture Notes in Computer Science, 966:43{??, 1995.

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