A parallel implementation model of HPARLOG

  • Huang Heyan 


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.


Logic Program Goal Process Stream Communication Logic Programming Language Parallel Inference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [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. [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. [3]
    E.Y. Shapiro, A subset of concurrent prolog and its interpreter, Technical Report TR-003, ICOT, Tokyo, Feb. 1983.Google Scholar
  4. [4]
    J.A. Crammond & C.D.F. Miller, An architecture for parallel logic languages, In Proc. 2nd Inter. Logic Programming Conf., July, 1984.Google Scholar
  5. [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.Google Scholar
  6. [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.Google Scholar
  7. [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.Google Scholar
  8. [8]
    D. DeGroot, Restricted AND-parallelism, Proc. of the International Conf. on 5th Generation Computer System, Nov. 1984 471–478.Google Scholar
  9. [9]
    A. Goto,et al., Highly parallel inference engine PIE-Goal rewriting model and machine architecture,New Generation Computer,2:1(1984), 37–58.CrossRefGoogle Scholar
  10. [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.Google Scholar
  11. [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.Google Scholar
  12. [12]
    C.A.R. Hoare, Communicating sequential process,Communications of the ACM,21:8(1978), 666–677.MATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    J.F. Nilsson, On the compilation of a domain-based prolog, Proc. IFIP 1983, North Holland Elsevier, 1983, 293–298.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1986

Authors and Affiliations

  • Huang Heyan 
    • 1
  1. 1.Institute of Computing TechnologyAcademia SinicaBeijingChina

Personalised recommendations