By Topic

Improved control strategy for parallel logic programming

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
$33 $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

1 Author(s)
I. J. Chung ; Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA

An attempt is made to formulate an improved control strategy for parallel logic programming systems and to verify its validity using the notion of the alternating Turing machine. The proposed control strategy is a combination of committed choice nondeterminism and the control-flow mechanism. It is shown that a natural reduction of the alternating Turing machine for the proposed control strategy yields a deterministic Turing whose complexity is linearly related to that of the alternating Turing machine. However, such a reduction for the conventional committed choice nondeterminism has complexity that is quadratically related to that of the alternating Turing machine

Published in:

Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on

Date of Conference:

23-25 Oct 1989