Skip to main content
Log in

A parallel implementation model of HPARLOG

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, a new parallel logic programming language—HPARLOG developed by us is described, and a new scheme for the AND-parallelism implementation in logic programming language is proposed. This scheme not only resolves the instantiation conflict on sharing-variables, thoroughly explores the parallelism of the programs with incrementally constructed data structure, but also decreases the dynamic complexity of the programs. In addition, a pseudo-copy based memory management scheme to enhance the locality of goal processes and lower the overhead of program execution is proposed.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.L. Clark & S. Gregory, PARLOG: parallel programming in logic, Research Report DOC 84/4, Dept. of Computing Imperial College, London, 1984.

    Google Scholar 

  2. K.L. Clark & S. Gregory, Notes on the implementation of PARLOG, Research Report DOC 84/16, Dept. of Computing Imperial College, London, 1984.

    Google Scholar 

  3. E.Y. Shapiro, A subset of concurrent prolog and its interpreter, Technical Report TR-003, ICOT, Tokyo, Feb. 1983.

    Google Scholar 

  4. J.A. Crammond & C.D.F. Miller, An architecture for parallel logic languages, In Proc. 2nd Inter. Logic Programming Conf., July, 1984.

  5. J.S. Conery & D.F. Kibler, Parallel interpretation of logic programs, In Proc. Conf. on Functional Programming Language and Computer Architecture, ACM, 163–170, Oct. 1981.

  6. J.S. Conery & D.F. Kibler, AND parallel in logic program, Proc. of the International joint Conf. on Artificial Intelligence, Karlsruhe, Germany, 1983, 539–543.

  7. J.S. Conery, The AND/OR model for parallel interpretation of logic program, PH.D. Thesis, Dept. of Information and Computer Science. UC Trvine, 1983.

  8. D. DeGroot, Restricted AND-parallelism, Proc. of the International Conf. on 5th Generation Computer System, Nov. 1984 471–478.

  9. A. Goto,et al., Highly parallel inference engine PIE-Goal rewriting model and machine architecture,New Generation Computer,2:1(1984), 37–58.

    Article  Google Scholar 

  10. T. Mota-okaet al, The architecture of a parallel inference engine-PIE, Proc. of the Inter. Conf. on FGCS 1984, Nov. 1984 479–488.

  11. S. Kasif, M. Kohli & J. Minker, PRISM: a parallel inference system for problem solving, In Proc. of Logic Programming Workship 83, 123–152, June, 1983.

  12. C.A.R. Hoare, Communicating sequential process,Communications of the ACM,21:8(1978), 666–677.

    Article  MATH  MathSciNet  Google Scholar 

  13. J.F. Nilsson, On the compilation of a domain-based prolog, Proc. IFIP 1983, North Holland Elsevier, 1983, 293–298.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, H. A parallel implementation model of HPARLOG. J. of Compt. Sci. & Technol. 1, 27–38 (1986). https://doi.org/10.1007/BF02943306

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943306

Keywords

Navigation