Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
On the scheme of passing arguments in stack frames for Prolog
Proceedings of the eleventh international conference on Logic programming
Design of a separable transition-diagram compiler
Communications of the ACM
So Many WAM Variations, So Little Time
CL '00 Proceedings of the First International Conference on Computational Logic
Programming finite-domain constraint propagators in Action Rules
Theory and Practice of Logic Programming
A register-free abstract prolog machine with jumbo instructions
ICLP'07 Proceedings of the 23rd international conference on Logic programming
The language features and architecture of b-prolog
Theory and Practice of Logic Programming - Prolog Systems
| Hi-index | 0.00 |
Two implementations of Action Rules are presented in the context of a WAM-like Prolog system: one follows a meta-call based approach, the other uses suspended WAM environments on the WAM heap. Both are based on a program transformation that clarifies the semantics of Action Rules. Their implementation is compared experimentally to the TOAM-based implementation of Action Rules in B-Prolog. The suspension based approach is faster at reactivating agents on the instantiation event. The meta-call approach is easier to implement, performs overall very good and much better for synchronous events, and it is more flexible than the suspension based approaches.