This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
PARLOG and its Applications
December 1988 (vol. 14 no. 12)
pp. 1792-1804

The key concepts of the parallel logic programming language PARLOG are introduced by comparing the language with Prolog. Some familiarity with Prolog and with the concepts of logic programming is assumed. Two major application areas of PARLOG, systems programming and object-oriented programming, are illustrated. Other applications are briefly surveyed.

[1] K. Broda and S. Gregory, "PARLOG for discrete event simulation," inProc. 2nd Int. Conf. Logic Programming, S.-A. Tarnlund, Ed., Uppsala, July 1984, pp. 301-312.
[2] M. Buckle, "Process modelling in PARLOG," M.Sc. thesis, Dep. Artificial Intell., Univ. Edinburgh, 1987.
[3] K. L. Clark, "PARLOG: The language and its applications," inProc. PARLE Conf., Eindoven, The Netherlands. Berlin: Springer-Verlag, 1987, pp. 212-242.
[4] K. L. Clark, and I. T. Foster, "A declarative environment for concurrent logic programming," inProc. Tapsoft 87 Conf., Pisa, Italy. Berlin: Springer-Verlag, 1987.
[5] K. L. Clark and S. Gregory, "A relational language for parallel programming," inProc. ACM Conf. Functional Languages and Computer Architecture, Portsmouth, NH, Arvind and J. Dennis, Eds., 1981, pp. 171-178.
[6] K. L. Clark and S. Gregory, "PARLOG: Parallel programming in logic,"ACM Trans. Program. Lang., vol. 8, pp. 1-49, 1986.
[7] K. L. Clark and S. Gregory, "Notes on systems programming in PARLOG," inProc. Int. Conf. Fifth Generation Computer Systems, Tokyo, H. Aiso, Ed. Amsterdam, The Netherlands: Elsevier/North-Hollland, 1984, pp. 299-306.
[8] K. L. Clark and S. Gregory, "Notes on the implementation of PARLOG,"J. Logic Programming, vol. 2, no. 1, pp. 17-42, 1985.
[9] K. L. Clark and S. Gregory, "PARLOG and Prolog united," inProc. 4th Int. Logic Programming Conf., Melbourne. Cambridge, MA: MIT Press, 1987, pp. 927-961.
[10] J. Crammond, "Implementation of committed choice languages on shared memory multiprocessors," PARLOG Group, Dep. Comput., Imperial College, London, Res. Rep. (in preparation), 1988.
[11] M. G. Cutcher and M. J. Rigg, "PARAMEDICL: A computer aided medical diagnosis system for parallel architectures,"ICL Tech. J., vol. 5, no. 3, pp. 376-384, 1987.
[12] A. Davison, "POLKA, a PARLOG object oriented language," PARLOG Res. Group, Dep. Comput., Imperial College, London, Res. Rep., 1987.
[13] A. Davison, "Representing blackboards in PARLOG," PARLOG Res. Group, Dep. Comput., Imperial College, London, Res. Rep., 1987.
[14] J. Darlington and M. Reeve, "Alice--A Multiprocessor Reduction Machine for the Parallel Evaluation of Applicative Languages,"Proc. 1981 ACM Conf. Functional Programming Languages and Computer Architecture, 1981, pp. 65-75.
[15] E. W. Dijkstra,A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
[16] N. A. Elshiewy, "Logic programming of real time control of telecommunication systems," Comput. Sci. Lab., Ericsson Telecom, Sweden, Res. Rep., 1987.
[17] I. T. Foster, "The PARLOG programming system: Reference manual," PARLOG Res. Group, Dep. Comput., Imperial College, London, 1986.
[18] I. T. Foster, "Logic operating systems: Design issues," inProc. 4th Int. Logic Programming Conf., Melbourne. Cambridge, MA: MIT Press, 1987, pp. 910-926.
[19] I. T. Foster, "Parallel implementation of PARLOG," PARLOG Res. Group, Dep. Comput., Imperial College, London, Res. Rep., 1987.
[20] I. T. Foster, "Efficient metacontrol in parallel logic programming languages, "PARLOG Res. Group, Dep. Comput., Imperial College, London, Res. Rep., 1987.
[21] I. T. Foster, S. Gregory, G. A. Ringwood, and K. Satoh, "A sequential implementation of PARLOG," inProc. 3rd Int. Logic Programming Conf., London. Berlin: Springer-Verlag, 1986, pp. 149- 156.
[22] J. Garcia, M. Jourdan, and A. Rizk, "An implementation of PARLOG using high level tools," inProc. ESPRIT 87: Achievements and Impact. Amsterdam, The Netherlands: North-Holland, 1987, pp. 1265-1275.
[23] D. Gilbert, "Implementing LOTOS in PARLOG," M.Sc. thesis, Dep. Comput., Imperial College, London, 1987.
[24] D. Gilbert, "Executable LOTOS: Using PARLOG to implement an FDT," inProc. Protocol Specification, Testing and Verification VII, Zurich, 1987.
[25] S. Gregory,Parallel Logic Programming in Parlog--the Language and its Implementation(Int. Series in Logic Program.). London: Addison-Wesley, 1987.
[26] S. Gregory, I. Foster, A. D. Burt, and G. A. Ringwood, "An abstract machine for the implementation of PARLOG on uniprocessors," PARLOG Res. Group, Dep. Comput., Imperial College, London, Res. Rep., 1987.
[27] S. Gregory, R. Neely, and G. A. Ringwood, "PARLOG for specification, verification and simulation," inProc. 7th Int. Symp. Computer Hardware Description Languages and their Applications, Tokyo, C. J. Koomen and T. Moto-oka, Eds. Amsterdam, The Netherlands: Elsevier/North-Holland, 1985, pp. 139-148.
[28] C. A. R. Hoare, "Communicating sequential processes,"Commun. ACM, vol. 21, pp. 666-677, 1978.
[29] M. H. Huntbach, "Algorithmic PARLOG debugging," inProc. 1987 Symp. Logic Programming, San Francisco, CA, IEEE Comput. Soc. Press, 1987, pp. 288-297.
[30] M. H. Huntbach, "The partial evaluation of PARLOG programs," PARLOG Res. Group, Dep. Comput., Imperial College, London, Res. Rep., 1987.
[31] K. Kahn, E. D. Tribble, M. S. Miller, D. G. Bobrow, "Objects in concurrent logic languages," inProc. OOPSLA '86, Portland, OR, ACM, 1986.
[32] M. Lam and G. Gregory, "PARLOG and ALICE: A marriage of convenience," inProc. 4th Int. Logic Programming Conf., Melbourne. Cambridge, MA: MIT Press, 1987, pp. 294-310.
[33] M. Lam and G. Gregory, "Implementation of PARLOG on DACTL," PARLOG Res. Group, Dep. Comput., Imperial College, London, Draft Paper, 1987.
[34] F. G. McCabe, K. L. Clark, and B. D. Steel,micro-PARLOG 3.1 Programmers Reference Manual, Logic Programming Associates Ltd., London, 1984.
[35] Y. Matsumoto, "A parallel parsing system for natural language analysis," inProc. 3rd Int. Logic Programming Conf., London. Berlin: Springer-Verlag, 1986, pp. 396-409.
[36] C. Mierkowsky, S. Taylor, E. Shapiro, J. Levy, and M. Safra, "The design and Implementation of Flat Concurrent Prolog," Dep. Appl. Math., Weizmann Inst., Tech. Rep. CS85-09, 1985.
[37] G. A. Ringwood, "The dining logicians," M.Sc. thesis, Dep. Comput., Imperial College, London, 1984.
[38] G. A. Ringwood, "PARLOG86 and the dining logicians," PARLOG Res. Group, Dep. Comput., Imperial College, London, 1987; to appear inCommun. ACM, 1988.
[39] E. Y. Shapiro, "A subset of Concurrent Prolog and its interpreter," ICOT, Tech. Rep. TR-003, Tokyo, 1983.
[40] E. Y. Shapiro and C. Mierowsky, "Fair, biased, and self balancing merge operators," inProc. IEEE Symp. Logic Programming, Atlantic City, NJ, IEEE Comput. Soc. Press, 1984, pp. 83-90.
[41] E. Y. Shapiro and A. Takeuchi, "Object oriented programming in Concurrent Prolog,"New Generation Comput., vol. 1, pp. 25-48, 1983.
[42] A. Takeuchi and K. Furakawa, "Bounded buffer communication in Concurrent Prolog,"New Generation Comput., vol. 3, no. 2, pp. 145-155, 1985.
[43] A. Takeuchi and K. Furukawa,Parallel Logic Programming Languages(LNCS 225). New York: Springer-Verlag, 1986, pp. 242-254.
[44] R. Trehan and P. Wilk, "A parallel shift-reduce parser for committed choice non-deterministic logic languages," Artificial Intell. Applicat. Inst., Edinburgh Univ., Teeh. Rep. A1A1-TR-26, 1987.
[45] K. Ueda, "Guarded horn clauses," ICOT, Tokyo, Tech. Rep. TR- 103, 1985.
[46] R. Yang and H. Aiso, in "P-Prolog: A parallel logic language based on exclusive relation," inProc. 3rd Int. Logic Programming Conf., London. Berlin: Springer-Verlag, 1986, pp. 259-269.

Index Terms:
PARLOG; parallel logic programming language; PARLOG; Prolog; systems programming; object-oriented programming; high level languages; logic programming; object-oriented programming; parallel programming; PROLOG
Citation:
K.L. Clark, "PARLOG and its Applications," IEEE Transactions on Software Engineering, vol. 14, no. 12, pp. 1792-1804, Dec. 1988, doi:10.1109/32.9064
Usage of this product signifies your acceptance of the Terms of Use.