1. H. Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, 1991.
2. A. K. Bansal and J. L. Potter. An associative model to minimize matching and backtracking overhead in logic programs with large knowledge bases. Engineering Applications of Artificial Intelligence, 5(3):247–262, 1992.
3. J. Barklund and H. Millroth. Providing iteration and concurrency in logic programs through bounded quantifications. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 817–824, ICOT, Japan, 1992.
4. D. Diaz and P. Codognet. A minimal extension of the WAM for clp(FD). In D. S. Warren, editor, Logic Programming: Proceedings of the Tenth International Conference, pages 774–790, Budapest, Hungary, 1993. The MIT Press.
5. M. Dincbas, P. Van Hentenryck, and H. Simonis. Solving the car sequencing problem in constraint logic programming. In Proceedings of the European Conference on Artificial Intelligence, Munich, Germany, August 1988.