The OR-forest description for the execution of logic programs
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.
Unable to display preview. Download preview PDF.
- Kowalski, R. A. "Logic for Problem Solving," Elsevier-North Holland, New York, 1979.Google Scholar
- 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
- 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
- G.H.Pollard, "Parallel Execution of Horn Clause Programs," Ph.D. Thesis, Imperial College of Science and Technology, University of London, 1981.Google Scholar
- 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
- 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