By Topic

Reordering of Prolog programs with AND-parallelism

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)
Gooley, M.M. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Wah, B.

A method that allows reordering of Prolog causes without reordering their solutions, called order tracking, is presented. Reordering clauses enables the execution of a program at lower cost, as well as more goals to be run in AND-parallel; order tracking ensures that the reordered clauses behave exactly like their originals. The Markov-chain model is extended for estimating probability and cost, adding order tracking and a model for AND-parallel execution. This allows for estimation of when reordering and AND-parallelism will speed execution and when they will slow it

Published in:

Languages for Automation: Symbiotic and Intelligent Robots, 1988., IEEE Workshop on

Date of Conference:

29-31 Aug 1988