Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Krzysztof R. Apt, Logic programming, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991
	2	R. Bahgat. PANDORA: nondeterministic parallel logic programming. World Scienti~c, 1993.
	3	Y. Bekkers and P. Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of ILSP'95, pages 51{65, Portland, OR, Dec. 1995. MIT Press.
	4	Vítor Santos Costa , David H. D. Warren , Rong Yang, Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism, Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, p.83-93, April 21-24, 1991, Williamsburg, Virginia, United States
	5	J. W. De Bakker, Comparative semantics for flow of control in logic programming without logic, Information and Computation, v.94 n.2, p.123-179, Oct. 1991  [doi>10.1016/0890-5401(91)90036-2]
	6	Jaco de Bakker , Erik de Vink, Control flow semantics, MIT Press, Cambridge, MA, 1996
	7	J. W. de Bakker , J. N. Kok, Comparative metric semantics for concurrent Prolog, Theoretical Computer Science, v.75 n.1-2, p.15-43, Sep. 1990  [doi>10.1016/0304-3975(90)90060-U ]
	8	Frank S. de Boer , Joost N. Kok , Catuscia Palamidessi , Jan J. M. M. Rutten, A paradigm for asynchronous communication and its application to concurrent constraint programming, Logic programming languages: constraints, functions, and objects, MIT Press, Cambridge, MA, 1993
	9	Frank S. de Boer , Alessandra Di Pierro , Catuscia Palamidessi, Nondeterminism and infinite computations in constraint programming, Theoretical Computer Science, v.151 n.1, p.37-78, Nov. 13, 1995
	10	A. de Bruin. Experiments with continuation semantics: jumps, backtracking, dynamic networks. PhD thesis, Vrije Universiteit, Amsterdam, 1986.
	11	Arie de Bruin , Erik P. de Vink, Continuation Semantics for PROLOG with Cut, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming, p.178-192, March 13-17, 1989
	12	E. P. de Vink, Comparative semantics for PROLOG with cut, Science of Computer Programming, v.13 n.2-3, p.237-264, May 1990  [doi>10.1016/0167-6423(90)90072-L ]
	13	Steve Gregory, Parallel logic programming in PARLOG: the language and its implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
	14	Seif Haridi , Sverker Janson, Kernel Andorra Prolog and its computation model, Logic programming, MIT Press, Cambridge, MA, 1990
	15	Seif Haridi , Catuscia Palamidessi, Structural operational semantics for Kernel Andorra Prolog, Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages, p.238-253, June 1991, Eindhoven, The Netherlands
	16	Robert Kowalski, Algorithm = logic + control, Communications of the ACM, v.22 n.7, p.424-436, July 1979  [doi>10.1145/359131.359136]
	17	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	18	A. Mazurkiewicz. Proving algorithms by tail functions. Information and Control, 18:220{226, 1971.
	19	C. Mierkovsky, S. Taylor, E. Shapiro, J. Levy, and M. Safra. The design and implementation of at concurrent Prolog. Technical Report CS85-09, Weizmain Institute, Department of Applied Mathematics, Israel, 1985.
	20	E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, University of Edinburgh, Laboratory for Foundations of Computer Science, 1990.
	21	Nikolaos S. Papaspyrou , Dragan Maćoš, A study of evaluation order semantics in expressions with side effects, Journal of Functional Programming, v.10 n.3, p.227-244, May 2000  [doi>10.1017/S095679680000366X]
	22	S. Peyton Jones and J. H. (editors). Report on the programming language Haskell 98: a non-strict purely functional language, 1999. Available from http://haskell.org/.
	23	G. A. Ringwood, Parlog86 and the dining logicians, Communications of the ACM, v.31 n.1, p.10-25, Jan. 1988  [doi>10.1145/35043.35044]
	24	Silvija Seres , Michael Spivey , Tony Hoare, Algebra of logic programming, Proceedings of the 1999 international conference on Logic programming, p.184-199, November 1999, Las Cruces, New Mexico, United States
	25	E. Y. Shapiro. A subset of concurrent Prolog and its interpreter. Technical Report TR-003, ICOT, Tokyo, 1983.
	26	Ehud Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.413-510, Sep. 1989  [doi>10.1145/72551.72555]
	27	G. Smolka. A calculus for higher-order concurrent constraint programming with deep guards. Research Report RR-94-03, Deutsches Forschungszentrum f? ur Kunstliche Intelligenz (DFKI), Saarbrucken, Germany, 1994.
	28	G. Smolka. The Oz programming model. In Computer Science Today, volume 1000 of LNCS, pages 324{343. Springer Verlag, 1995.
	29	C. Strachey and C. P. Wadsworth. Continuations: a mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University, Programming Research Group, 1974.
	30	E. Todoran. Metric semantics for synchronous and assynchronous communication: a continuations based approach. Electronic Notes on Theoretical Computer Science, 28:119{146, 2000.
	31	Eneia Todoran , Jerry den Hartog , Erik de Vink, Comparative metric semantics for commit in or-parallel logic programming, Proceedings of the 1997 international symposium on Logic programming, p.101-115, November 1997, Port Washington, New York, United States
	32	K. Ueds, Guarded horn clauses: A parallel logic programming language with the concept of a guard, Proceedings of the first Franco-Japanese Symposium on Programming of future generation computers, p.441-456, August 1988, Tokyo, Japan
	33	Philip Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-14, January 19-22, 1992, Albuquerque, New Mexico, United States  [doi>10.1145/143165.143169]
	34	D. H. D. Warren. The Andorra principle. Talk given at the Gigalips Workshop, Swedish Institute of Computer Science (SICS), Stockholm, Sweden, 1988.
	35	D. H. D. Warren. Extended Andorra model with implicit control. Talk given at a Parallel Logic Programming Workshop, Eilat, Israel, 1990.
	36	Rong Yang, P-PROLOG: A Parallel Logic Programming Language, World Scientific Publishing Co., Inc., River Edge, NJ, 1987

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine