Negation and control in Prolog
Negation and control in Prolog
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
The Aurora or-parallel Prolog system
New Generation Computing - Selected papers on parallel logic programming from the International Conference on Fifth Generation Computer Systems, 1988
Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
The Muse Or-parallel Prolog model and its performance
Proceedings of the 1990 North American conference on Logic programming
Hybrid tree search in the Andorra model
Proceedings of the eleventh international conference on Logic programming
AKL(FD)—a concurrent language for FD programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
An and/or-parallel implementation of AKL
New Generation Computing - Special issue on the workshop on parallel logic programming
Garbage collection: algorithms for automatic dynamic memory management
Garbage collection: algorithms for automatic dynamic memory management
Extended dynamic dependent and-parallelism in ACE
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
IMPACT: innovative models for prolog with advanced control and tabling
ICLP'05 Proceedings of the 21st international conference on Logic Programming
An external module for implementing linear tabling in prolog
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Improving memory usage in the BEAM
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
A segment-swapping approach for executing trapped computations
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.01 |
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and parallelism. We present the BEAM, a design that builds upon David H. D. Warren's original EAM with Implicit Control. The BEAM supports Warren's original EAM rewrite rules plus eager splitting and sequential conjunctions. We discuss the main issues in the implementation of the BEAM and show that the EAM with Implicit Control can perform quite well when compared with other implementations that use the Andorra principle.