An abstract execution model for temporal logic programs

The paper proposes an abstract execution model which can be used as the basis for implementing temporal logic programs on multi-processor architectures. Temporal logic programs offer a form of parallelism, which we call temporal-parallelism, that does not exist in standard logic programs. Temporal-parallelism means that computations at different moments in time can be performed in parallel and independently of each other. We also outline the mapping of the abstract model onto a network of processors.<
>