Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Logic for problem-solving
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Logic Programming
Logic and Data Bases
A parallel Prolog: The construction of a data driven model
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Data sharing in an FFP machine
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Optimal associative searching on a cellular computer
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
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
Simulation of a reduction machine.
Simulation of a reduction machine.
Programming in reduction languages.
Programming in reduction languages.
Execution time and storage requirements of reduction language programs on a reduction machine.
Execution time and storage requirements of reduction language programs on a reduction machine.
ACM SIGART Bulletin
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
PROLOG applications for database design with the information center
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
| Hi-index | 0.00 |
This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate. Techniques for implementing the parallel evaluation of the clauses of a relation (OR parallelism) are given. Problems in the exploitation of the parallel evaluation of a conjunction of goals (AND parallelism) are discussed. An FFP representation of the run-time environment of PROLOG is given. It is based on a previously published FFP implementation of unification. It allows matching of arguments through unification in linear time and space.