By Topic

A systematic approach to exploiting implicit parallelism in Prolog

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gupta, G. ; Dept. of Comput. Sci., New Mexico State Univ., Las Cruces, NM, USA ; Costa, V.S.

Parallel execution of logic programs is discussed. The authors argue that implicit parallelism can be extracted from full Prolog. By full Prolog they mean pure Prolog with extralogical features such as sideeffects, database predicates and cuts. Prolog programs have three main forms of implicit parallelism present in them: OR-parallelism, independent AND-parallelism, and dependent AND-parallelism. Starting from an OR-parallel version of full Prolog, it is shown that independent AND-parallel and dependent AND-parallel versions can be systematically derived. Details are presented of how the environment is represented by using paged binding arrays to handle multiple bindings of variables in the presence of OR-, independent AND-, and dependent AND-parallelism. It is also shown that extralogical predicates can be supported in this combined parallel implementation of Prolog

Published in:

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on  (Volume:ii )

Date of Conference:

5-8 Jan 1993