Skip to main content
SpringerLink
Log in

Parlog: Parallel Programming in Logic

  • Chapter
Parallel Computation and Computers for Artificial Intelligence

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 26))

Abstract

Parlog is a logic programming language in the sense that nearly every procedure can be read as a definition of a relation in first-order predicate logic. Parlog differs from Prolog in incorporating parallel evaluation. It incorporates both AND-parallelism and OR-parallelism. This chapter is an updated and shortened version of [4]. A more-detailed account of the language can be found in [16].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Broda and S. Gregory, “PARLOG for Discrete Event Simulation,” Proc. 2nd Int’l Logic Programming Conference, Uppsala, Sweden, July 1984, pp. 301–312.

    Google Scholar 

  2. K. L. Clark, “Negation as Failure.” In H. Gallaire and J. Minker (eds.), Logic and Databases. New York: Plenum Press, 1978.

    Google Scholar 

  3. K. L. Clark and S. Gregory, “A Relational Language for Parallel Programming.” Proc. 1981 ACM Conf. on Functional Programming Languages and Computer Architecture, Portsmouth, NH, Oct. 1981, pp. 171–178.

    Google Scholar 

  4. K. L., Clark and S. Gregory, “PARLOG: Parallel Programming in Logic,” ACM Trans, on Programming Languages and Systems, 8(1): 1–49, 1986.

    Article  MATH  Google Scholar 

  5. K. L., Clark and S. Gregory, “Notes on Systems Programming in PARLOG,” Proc. Int’l Conf. on Fifth Generation Computer Systems, Tokyo, Japan, Nov. 1984, pp. 299–306.

    Google Scholar 

  6. K. L., Clark and S. Gregory, “Notes on the Implementation of PARLOG,” J. of Logic Programming 2 (l):17–42, 1985.

    Article  MATH  Google Scholar 

  7. K. L. Clark and F. G. McCabe, “Micro-PROLOG: Programming in Logic,” Englewood Cliffs, Prentice-Hall, NJ: 1984.

    Google Scholar 

  8. K. L., Clark, F. G., McCabe, and S. Gregory, “IC-PROLOG Language features,” in K. Clark and S-A. Tarnlund (eds.), Logic Programming. London: Academic Press, 1982, pp. 253–266.

    Google Scholar 

  9. W. F. Clocksin and C. Mellish, Programming in Prolag. New York: Springer-Verlag, 1981.

    Google Scholar 

  10. J. Darlington and M. J. Reeve, “ALICE: A Multi-Processor Reduction Machine.” Proc. 1981 ACM Conf on Functional Programming Languages and Computer Architecture, Portsmouth, NH, Oct. 1981, pp. 65–75.

    Google Scholar 

  11. E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.

    MATH  Google Scholar 

  12. I. T., Foster, “Logic Operating Systems: Design Issues.” Proc. 4th International Logic Programming Conf., Melbourne, Australia, May 1987.

    Google Scholar 

  13. D. P. Friedman and D. S. Wise, “CONS Should Not Evaluate Its Arguments,” In Proc. 3rd Int’l Colloquium on Automata, Languages and Programming. Edinburgh: Edinburgh University Press, 1976.

    Google Scholar 

  14. S. Gregory: “How to Use PARLOG.” Unpublished report, Department of Computing, Imperial College, London, England, Aug. 1984.

    Google Scholar 

  15. S. Gregory, Implementing PARLOG on the Abstract PROLOG Machine. Research Rep. DOC 84/23, Department of Computing, Imperial College, London, England, Aug. 1984.

    Google Scholar 

  16. S. Gregory, Parallel Logic Programming in PARLOG. Reading, MA: Addison-Wesley, 1987.

    Google Scholar 

  17. S. Gregory, I. T. Foster, A. D. Burt, and G. A. Ringwood, An Abstract Machine for the Implementation of PARLOG on Uniprocessors. Research rep., Department of Computing, Imperial College, London, England, Jan. 1987.

    Google Scholar 

  18. S. Gregory, R. Neely, and G. A. Ringwood, “PARLOG for Specification, Verification and Simulation.” Proc. 7th Int’l Symp. on Computer Hardware Description Languages and Their Applications, Tokyo, Japan, Aug. 1985, pp. 139–148.

    Google Scholar 

  19. A. Hansson, S. Haridi, and S-A. Tarnlund, “Properties of a Logic Programming Language.” In K. L. Clark and S-A. Tarnlund (eds.): Logic Programming, London: Academic Press, 1982, pp. 267–280.

    Google Scholar 

  20. P. Henderson and J. H. Morris, “A Lazy Evaluator,” Proc. 3rd ACM Symp. on Principles of Programming Languages, Jan. 1976, pp. 95–103.

    Google Scholar 

  21. C. A. R. Hoare, “Communicating Sequential Processes.” Comm. of the ACM, 21(8): 666–677,1978.

    Article  MathSciNet  MATH  Google Scholar 

  22. C. J. Hogger, Introduction to Logic Programming. London: Academic Press, 1984.

    MATH  Google Scholar 

  23. G. Kahn and D. B. MacQueen, “Coroutines and Networks of Parallel Processes,” Proc. of the IFIP Congress, 77:993–998, 1977.

    Google Scholar 

  24. R. A. Kowalski, “Predicate Logic as Programming Language.” Proc. of the IFIP Congress, 74: 569–574, 1974.

    Google Scholar 

  25. R. A. Kowalski, Logic for Problem Solving. New York: North Holland, 1979.

    MATH  Google Scholar 

  26. R. A. Kowalski, “Logic Programming,” Proc. IFIP Congress, 83:133–145, 1983.

    Google Scholar 

  27. A. Lam, M. Y. C. and S. Gregory, “PARLOG and ALICE: A Marriage of Convenience,” Proc. of the 4th Int’l Logic Programming Con., Melbourne, Australia, May 1987.

    Google Scholar 

  28. J. Levy, “A Unification Algorithm for Concurrent Prolog,” Proc. 2nd Int’l Logic Programming Conference, Uppsala, Sweden, July 1984, pp. 333–341.

    Google Scholar 

  29. Y. Matsumoto, “A Parallel Parsing System for Natural Language Analysis,” Proc. 3rd Int’l Logic Programming Conference, London, England, July 1986.

    Google Scholar 

  30. F. G. McCabe, Abstract PROLOG Machine—A Specification. Research Report DOC 83/12, Department of Computing, Imperial College, London, England, June 1984.

    Google Scholar 

  31. C. Mierowsky, Design and Implementation of Flat Concurrent Prolog. M.Sc. thesis, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, Nov. 1984.

    Google Scholar 

  32. T. Miyazaki, A. Takeuchi, and T. Chikayama, “A Sequential Implementation of Concurrent Prolog Based on the Shallow Binding Scheme,” Proc. IEEE Symposium on Logic Programming, Boston, MA, July 1985, pp. 110–118.

    Google Scholar 

  33. E. Moens and B. Yu, Implementation of PARLOG on the Warren Machine, Tech. Rep., Department of Computer Science, University of British Columbia, Vancouver, Canada 1985.

    Google Scholar 

  34. M. J. Reeve, “A BNF Description of the ALICE Compiler Target Language.” Unpublished report, Department of Computing, Imperial College, London, England, March 1985.

    Google Scholar 

  35. J. Schwarz, Using Annotations To Make Recursion Equations Behave. Research rep. 43, Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland, 1977.

    Google Scholar 

  36. E. Y. Shapiro, A Subset of Concurrent Prolog and Its Interpreter. Tech. Rep. TR-003, ICOT, Tokyo, Japan, Feb. 1983.

    Google Scholar 

  37. E. Y. Shapiro, “Systems Programming in Concurrent Prolog,” Proc. 11th ACM Symp. on Principles of Programming Languages, Salt Lake City, UT, Jan. 1984.

    Google Scholar 

  38. K. Ueda, Guarded Horn Clauses. Tech. Rep. TR-103, ICOT, Tokyo, Japan, June 1985.

    Google Scholar 

  39. D. H. D. Warren, “Logic Programming and Compiler Writing,” Software—Practice and Experience, 10:97–125, 1980.

    Article  MATH  Google Scholar 

  40. D. H. D. Warren, “An Abstract Prolog Instruction Set.” Technical Note 309, SRI International, Menlo Park, CA, Oct. 1983.

    Google Scholar 

Download references

Authors
  1. Keith Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steve Gregory
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Boeing Computer Services, Bellevue, Washington, USA

    Janusz S. Kowalik

  2. University of Washington, Seattle, Washington, USA

    Janusz S. Kowalik

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers

About this chapter

Cite this chapter

Clark, K., Gregory, S. (1988). Parlog: Parallel Programming in Logic. In: Kowalik, J.S. (eds) Parallel Computation and Computers for Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, vol 26. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1989-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1989-4_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9188-6

  • Online ISBN: 978-1-4613-1989-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation