Parlog86 and the dining logicians

ABSTRACT

A classic problem in concurrent programming is that of the "dining philosophers" which challenges the power of any aspiring concurrent program language. Recently, a growing number of logic programming languages have been refined to handle concurrent programming, one in particular is Parlog86.

REFERENCES

• 1: Ivan Bratko, Prolog programming for artificial intelligence, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 2: Keith L. Clark , Steve Gregory, A relational language for parallel programming, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.171-178, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806776]
• 3: Clark, K.L., and Gregory, S. Parlog: A parallel logic programming language. Res. Rep. DOC 83/5. Dept. of Computing, Imperial College, London, 1983.
• 4: Keith Clark , Steve Gregory, PARLOG: parallel programming in logic, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.1, p.1-49, Jan. 1986 [doi>10.1145/5001.5390]
• 5: Clark, K.L., and Gregory, S. Notes on the implementation of Parlog. J. Logic Program. 2(1) (1985}, 17-42.
• 6: Clark, K.L., and McCabe, F.G. The control facilities of IC-Prolog. In Expert Systems in the Micro-Electronic Age, D. Michie, Ed. Edinburgh University Press, Edinburgh, U.K., 1979.
• 7: Cohen, J. A view of the origins and development of Prolog. Rep. Dept. of Computer Science, Brandeis Univ., Waltham, Mass., 1986.
• 8: John S. Conery, Parallel execution of logic programs, Kluwer Academic Publishers, Norwell, MA, 1986
• 9: Davis, R.E. Runnable specification as a design tool. In Logic Programming, K.L. Clark and S.A. Tarnlund, Eds. Academic Press, New York, pp. 141-149.
• 10: Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta Inf. I (1971), 115-138.
• 11: Edsger W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, v.18 n.8, p.453-457, Aug. 1975 [doi>10.1145/360933.360975]
• 12: Filman, R.E., and Friedman, D.P. Coordinated Computing. McGraw- Hill, New York, 1984.
• 13: Daniel P. Friedman , David S. Wise, An indeterminate constructor for applicative programming, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.245-250, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567470]
• 14: Gregory, S., Neely, R., and Ringwood, G.A. Parlog for specification verification and simulation, In CHDL 85 (7th International Conference on Computer Hardware Description Languages), C.J. Koomen and T. Moto-oka, Eds. North-Holland, Amsterdam, 1985, pp. 139-148.
• 15: C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
• 16: Hoare, C.A.R. Specifications, programs and implementations. Tech. Monogr. PRG-29. Programming Research Group, Oxford Univ., Oxford, England, 1982.
• 17: C. A. R. Hoare, Communicating sequential processes, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
• 18: Kahn, G. The semantics of a simple language for parallel programming. In Proceedings of IFIP 74. North-Holland, Amsterdam, 1974, pp. 471-475.
• 19: Kowalski, R. Predicate logic as a computational formalism. In Proceedings of IFIP 74. J.L. Rosenfeld, Ed., North-Holland, Amsterdam, 1974, pp. 569-574.
• 20: Kowalski, R. The relation between logic programming and logic specification. Phil. Trans. R. Soc. Lond. A 312 (1984), 345-361.
• 21: Kowalski, R. The early history of logic programming. Res. Rep. Dept. of Computing, Imperial College, London, 1984.
• 22: Mierkowsky, C., Taylor, S., Shapiro, E., Levy, J., and Safra, M. The design and implementation of Flat Concurrent Prolog. Tech. Rep. CS85-09. Dept. of Applied Maths, Weizmann Institute, Israel, 1985.
• 23: R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
• 24: Pollard, G.H. Parallel execution of Horn Clause programs. Ph.D. thesis. Dept. of Computing, Imperial College, London, 1981.
• 25: Ringwood, G.A. Pattern-directed, Markovian. linear, guarded definite clause resolution. J. Logic Program. To be published.
• 26: Robinson, J.A. Logic programming: Past, present and future. Tech. Rep. TR-015. ICOT, Tokyo, 1983.
• 27: Saraswat, V.}. Problems with Concurrent Prolog. Tech. Rep. CS-86- 100. Dept. of Computing Science, Carnegie-Mellon Univ., Pittsburgh, Pa., 1986.
• 28: V. A. Saraswat, The concurrent logic programming language CP: Definition and operational semantics, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.49-62, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41630]
• 29: Shapiro, E.Y. A subset of Concurrent Prolog and its interpreter. Tech. Rep. TR-003. ICOT, Tokyo, 1983.
• 30: Shapiro, E.Y. Concurrent Prolog: A progress report. Tech Rep. CS86- 10. Dept. of Applied Maths, Weizmann Institute, Israel, 1986.
• 31: Ueda, K. Concurrent Prolog re-examined. Tech Rep. TR-102. ICOT, Tokyo, 1985.
• 32: Ueda. K. Guarded Horn Clauses. Tech Rep. TR-103. ICOT, Tokyo, 1985.
• 33: Ueda, K. Guarded Horn Clauses. Ph.D. thesis. Univ. of Tokyo, Tokyo, Japan, 1986.
• 34: Van Emden, M.H., and De Luceana, G.J. Predicate logic as a language for parallel programming. Rep. CS 79-15. Dept. of Computer Science, Univ. of Waterloo, Waterloo, Ontario, 1979. (Also in Logic Programming, K.L. Clark and S.A. Tarnlund, Eds. Academic Press, New York, 1982, pp. 189-198.)

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: Prolog

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: Parlog86

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE

General Terms:
Languages, Theory