A Reduction Model For Parallel Interpretation Of Logic Programs
Lun Wang · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1987
Applicative models of computation based on applicative languages have, in recent years, received considerable attention as an attractive alternative to the Von Neumann model. Prolog is a high level applicative language. Its execution is conceptually an AND-OR tree search based on resolution proof procedure. This paper presents a reduction model for parallel interpretation of applicative languages such as Prolog, LISP. Reduction semantics of logic programs is analysed. A new classification of proposed models for parallel execution of logic programs is also given.