1. Bahgat, R.,Non-Deterministic Concurrent Logic Programming in Pandora, World Scientific, 1993.
2. Beaumont, A., Raman, S.M., Szeredi, P., and Warren, D.H.D., “Flexible Scheduling of OR-Parallelism in Aurora: The Bristol Scheduler,” inPARLE91: Conference on Parallel Architectures and Languages Europe, volume 2, Springer_Verlag, pp. 403–420, June 1991.
3. Crammond, J.A., “Implementation of Committed Choice Logic Languages on Shared Memory Multiprocessors,”Ph.D thesis, Heriot-Watt University, Edinburgh, May 1988.Research Report, PAR 88/4, Department of Computing, Imperial College, London.
4. Debray, S.K., “A Simple Code Improvement Scheme for Prolog,” inSixth International Conference on Logic Programming, MIT Press, pp. 17–32, June 1989.
5. Dutra, I. “Strategies for Scheduling And- and Or-Work in Prallel Logic Programming Systems,” inLogic Programming: Proceedings of the 1994 International Symposium, MIT Press, pp. 289–304, 1994.