Share Email Print

Proceedings Paper

A Reduction Model For Parallel Interpretation Of Logic Programs
Author(s): Wang Lun
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 6 April 1987
PDF: 2 pages
Proc. SPIE 0657, Applications of Artificial Intelligence IV, (6 April 1987); doi: 10.1117/12.938501
Show Author Affiliations
Wang Lun, Harbin Institute of Technology (China)

Published in SPIE Proceedings Vol. 0657:
Applications of Artificial Intelligence IV
John F. Gilmore, Editor(s)

© SPIE. Terms of Use
Back to Top