@inproceedings{ffe9dd1f4809410cad26795ebad9e360,
title = "An abstract machine for the reduce-OR process model for parallel prolog",
abstract = "We discuss the design of an abstract machine for the Reduce-OR process model (ROPM) for the AND and OR parallel execution of Prolog programs. It differs from the WAM in many respects, and some of these differences are elaborated upon in this paper. Some of the significant differences are related to the binding environment which has been designed to support AND and OR parallel execution of logic programs on both shared and nonshared memory machines, the process model, and the handling of solutions for AND parallel branches in the Data Join Graph (DJG 1) that is used to represent data dependencies in a Prolog clause. An emulator for the abstract machine has been implemented and is targeted for both shared and nonshared memory machines.",
author = "Balkrishna Ramkumar and Kal{\'e}, {Laxmikant V.}",
note = "Funding Information: *This work is supported in part by a National Science Foundation grant NSF CCR-87-00988 1The difference is that in DJGs arcs represent literals and nodes represent the joining points for the data produced by titerals on its incoming ares.; 2nd International Conference on Knowledge Based Computer Systems, KBCS 1989 ; Conference date: 11-12-1989 Through 13-12-1989",
year = "1990",
doi = "10.1007/BFb0018385",
language = "English (US)",
isbn = "9783540528500",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag Berlin Heidelberg",
pages = "266--275",
editor = "S. Ramani and R. Chandrasekar and K.S.R. Anjaneyulu",
booktitle = "Knowledge Based Computer Systems - International Conference KBCS 1989, Proceedings",
}