1. K. L. Clark and S. Gregory, PARLOG: Parallel Programming in Logic, (ed.), E. Y. Shapiro,Concurrent Prolog: Collected Papers, MIT Press, Cambridge, Massachusetts1:84?139 (1987).
2. M. Quinn and Y. Yoo, Data Structures for the Efficient Solution of Graph Theoretic Problems on Tightly Coupled MIMD Computers,Int'l. Conf. on Parallel Processing, Penn State, pp. 431?438 (August 1984).
3. E. F. Moore, The Shortest Path Through a Maze,Proc. of the Int'l. Symp. on Theory of Switching, Harvard University Press, Cambridge, Massachusetts, pp. 285?292 (April 1957).
4. K. Wada and H. Ichiyoshi, A Study of Mapping Locally Message Exchanging Algorithms on a Loosely-Coupled Multiprocessor, Technical Report 587, ICOT, 1-4-28 Mita, Minato-ku Tokyo 108, Japan (August 1990).
5. E. Y. Shapiro, The Family of Concurrent Logic Programming Languages,ACM Computing Surveys 21(3):413?510 (September 1989).