Experiments with binding schemes in LOGFLOW

. The handling of variables is a crucial issue in designing a parallel Prolog system. In the framework of the LOGFLOW project some experiments were made with binding methods. The work is an analysis of possible schemes, a modification of an existing one and a plan for future implementations of LOGFLOW on new architectures. The conditions, principles and results are presented in this paper. 1 Introduction Logic programming languages offer a high degree of inherent parallelism [4]. The central question in implementing an OR-parallel Prolog system is how the conditional bindings can be handled consistently and effectively. There are a number of techniques for treating conditional bindings. They can be categorized as stack sharing [1][3][5] [6], stack copying [11] and recomputation methods. All these techniques have a common feature: references (either physical or logical) are allowed to point from an environment to any other environments. However, in a distributed memory system these env..