Skip to main content
SpringerLink
Log in

A new method for describing the AND-OR-parallel execution of logic programs

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

Abstract

A new method for describing the execution of logic programs is presented in this paper. Our method, named OR-forest, not only retains the merits of the traditional OR-tree description in achieving high independence of each computation unit, but also overcomes the two major drawbacks of the traditional OR-tree description: the lack of the ability for describing AND-parallel execution and the redundancies in describing OR-parallel execution, It provides a new framework for developing execution models which could efficiently exploit both AND—and OR-parallelisms in logic programs.

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

Access this article

Log in via an institution

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. J. W. Lloyd, Fundations of Logic Programming, Springer Verlag, Berlin, 1984.

    Google Scholar 

  2. A. Ciepielewski and S. Haridi, A Formal Model for OR-parallel Execution of Logic Programs, Proc. of IFIP (Sept., 1983), 299–306.

  3. A. Ciepielewski, Towards a Computer Architecture for OR-parallel Execution of Logic Programs, Ph.D. Thesis, Dept. of Computer Systems, Royal Institute of Technology, TRITA-CS-8401, Sweden, May 1984.

  4. A. Goto, H. Tanaka and T. Moto-oka, Highly parallel inference engine PIE—Goal rewriting model and machine architecture,New Generation Computing,2: 1(1984) 37–58.

    Article  Google Scholar 

  5. G. H. Pollard, Parallel Execution of Horn Clause Programs, Pr. D. Thesis, Imperial College of Science and Technology, University of London, 1981.

  6. J.S. Conery and D.F. Kibler, AND Parallelism in Logic Programs, Proc. of the International Joint Conference on Artificial Intelligence, Karlsruhe, 1983, 539–543.

  7. J.S. Conery, The AND/OR Process Model for Parallel Interpretation of Logic Programs, Ph. D. Thesis, Dept. of Information and Computer Science, UC Irvine, 1983.

  8. S. Umeyama and K. Tamura, Parallel Execution of Logic Programs, Proc. of the 10th Symp. on Computer Architecture, 349–355, 1983.

  9. D. DeGroot, Restricted AND-parallelism, Proc. of the International Conference on FGCSs. 471–478, Nov. 1984.

  10. Sun Chengzheng and Tzu Yungui, The OR-forest Description for the Execution of Logic Programs, TR-85-6031, Dept. of Computer Science, Changsha Institute of Technology, China.

  11. Sun Chengzheng and Tzu Yungui, PSOF: A Process Model Based on the OR-forest Description, TR-85-6032, Dept. of Computer Science, Changsha Institute of Technology, China.

  12. Sun Chengzheng and Tzu Yungui, An Automatic Partition Algorithm for AND-parallel Execution in the Framework of OR-forest, TR-85-6040. Dept. of Computer Science. Changsha Institute of Technology, China.

Download references

Author information

Authors and Affiliations

  1. Changsha Institute of Technology, Changsha, China

    Sun Chengzheng & Tzu Yungui

Authors
  1. Sun Chengzheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tzu Yungui
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, C., Tzu, Y. A new method for describing the AND-OR-parallel execution of logic programs. J. of Comput. Sci. & Technol. 3, 102–112 (1988). https://doi.org/10.1007/BF02943336

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation