Title :
Improved control strategy for parallel logic programming
Author_Institution :
Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA
Abstract :
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
Keywords :
Turing machines; logic programming; parallel programming; alternating Turing machine; committed choice nondeterminism; control-flow mechanism; natural reduction; parallel logic programming; program control strategy; Cascading style sheets; Cities and towns; Computational modeling; Computer languages; Computer science; Concurrent computing; Control systems; Logic programming; Parallel processing; Turing machines;
Conference_Titel :
Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-1984-8
DOI :
10.1109/TAI.1989.65384
