Parallel Execution of Temporal Logic Programs Using Dataflow Computation

]The paper presents a data--driven execution model, CHEM, for a temporal logic programing language, Chronolog. An intermediate virtual machine is proposed, which is granulated at clause argument level to exploit argument parallelism through unification. Context--parallelism, inherent in temporal logic programs, is exploited through dynamic tagging approach typically used in dataflow computers. The model is process --based and supports AND--, OR--parallelism in the highly distributed dataflow environment. Implementation techniques used to support these forms of parallelism are described. Keywords: Chronolog, temporal logic programs, parallelism, data--driven model, virtual machine. 1. INTRODUCTION Temporal logic [Gol87] has been successfully used as a formalism in concurrent program specification and verification, modelling temporal databases and reasoning about time. More recently, several researchers have suggested that temporal logic can be directly used to extend the basis of logi..