First version of a data flow procedure language
Programming Symposium, Proceedings Colloque sur la Programmation
Parallel interpretation of logic programs
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Prolog - the language and its implementation compared with Lisp
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
A data-driven model for a subset of logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Exploiting variable grain parallelism at runtime
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
High-speed implementations of rule-based systems
ACM Transactions on Computer Systems (TOCS)
A methodology for detecting shared variable dependencies in logic programs
Journal of Symbolic Computation
| Hi-index | 0.01 |
A logic programming language offers several kinds of parallelism for its execution. Among these, this paper concentrates on OR-parallelism which is an alternative to the backtracking mechanism of a serial interpreter, and proposes an abstract model for OR-parallel interpretation. It consists of tokens and five kinds of function units mutually connected as a process graph. The overall processing is done by the flows of tokens among these units. We also present a mechanism for token labeling, which makes this process graph reentrant. A simulation result is given to show how efficiently the model works in terms of parallelism.