A Reduction Model For Parallel Interpretation Of Logic Programs

Wang Lun

doi:10.1117/12.938501

6 April 1987 A Reduction Model For Parallel Interpretation Of Logic Programs

Wang Lun

Proceedings Volume 0657, Applications of Artificial Intelligence IV; (1987) https://doi.org/10.1117/12.938501
Event: 1986 International Symposium/Innsbruck, 1986, Innsbruck, Austria

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.

Citation Download Citation

Wang Lun "A Reduction Model For Parallel Interpretation Of Logic Programs", Proc. SPIE 0657, Applications of Artificial Intelligence IV, (6 April 1987); https://doi.org/10.1117/12.938501

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available