The Generalized Dataflow Model (GDM) and the Logicflow Model have been recently introduced for OR and pipeline AND-parallel execution of pure logic programs. An informal description of the COR, HCOR and CUT nodes of the Logicflow Model has been given and it was shown how the 'cut' mechanism of Prolog can be realised based on the Logicflow Model. In the current paper a more formal and exact definition is given for these nodes based on their construction by the Generalised Dataflow Model. It will be shown that extending the GDM with the new node types does not modify the properties of the model relevant for the distributed memory based implementation of logic programs.
展开▼
