Skip to main content
SpringerLink
Log in

The OR-forest description for the execution of logic programs

  • Session 7b: Models Of Computation And Implementation
  • Conference paper
  • First Online:
Book cover Third International Conference on Logic Programming (ICLP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 225))

Included in the following conference series:

Abstract

This paper presents a new method for desoribing the execution of logic programs — the OR-forest description.

The OR-forest description can explicitly describe both AND- and OR-parallel execution of logic programs and avoid a class of redundancies in describing OR-parallel execution, overcoming the two major drawbacks of the traditional OR-tree discription.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kowalski, R. A. "Logic for Problem Solving," Elsevier-North Holland, New York, 1979.

    Google Scholar 

  2. Ciepielewski, A. "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, May 1984.

    Google Scholar 

  3. Goto, A., Tanaka, H. and Moto-oka, T. "Highly Parallel Inference Engine PIE — Goal Rewriting Modle and Machine Architecture," New Generation Computing, Vol.2., No. 1, pp.37–58, OHMSHA, 1984.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. 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, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, 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

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chengzheng, S., Yungui, T. (1986). The OR-forest description for the execution of logic programs. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_120

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_120

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation