论文信息 - Improved control strategy for parallel logic programming

Improved control strategy for parallel logic programming

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.<<ETX>>

In-Jeong Chung | I. Chung

[1] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.

[2] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[3] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[4] David Harel,et al. And/Or Programs: A New Approach to Structured Programming , 1980, TOPL.

[5] Daniel P. Friedman,et al. Coordinated computing: tools and techniques for distributed software , 1984 .

[6] Ehud Y. Shapiro. Alternation and the Computational Complexity of Logic Programs , 1984, J. Log. Program..

[7] Robert A. Kowalski,et al. Algorithm = logic + control , 1979, CACM.

[8] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[9] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[10] Petr Stepánek,et al. Logic Programs and Alternation , 1986, ICLP.

[11] Alon Itai,et al. Unification as a Complexity Measure for Logic Programming , 1987, J. Log. Program..