Abstract
One of the most exciting and promising aspects of logic programming is its richness of parallel execution models. The challenge is to find cost-effective, robust implementation techniques for these parallel execution models. A fairly large number of techniques have been proposed so far, and more are continually being proposed. Although these models possess many unique features, most are based on one form or another of either AND-parallelism or OR-parallelism as a result of the fact that the program-execution search-spaces of logic programs are naturally expressed as AND-OR search trees [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J-H. Chang, A. Despain, and D. DeGroot, “AND-Parallelism of Logic Programs Based on Static Data Dependency Analysis,” Proc. 30th IEEE Computer Society Intl. Conf., 1985, pp. 218–226.
J. Conery, Parallel Execution of Logic Programs, Norwell, MA: Kluwer Academic Press, 1986.
J. Crammond, “A Comparative Study of Unification Algorithms for OR-Parallel Execution of Logic Languages,” IEEE Trans, on Computers, Vol C-34(10): 911–917, 1985. (Special Issue on Parallel Processing, Doug DeGroot, ed.).
D. DeGroot, “Restricted And-Parallelism,” Proc. Int’l Conf. on Fifth Generation Computer Systems, OHMSHA, Tokyo, 1984, pp. 471–478.
D. DeGroot, “Alternate Graph Expressions for Restricted And-Parallelism.” Proc. COMPCON, Spring 85, IEEE, 1985, pp. 206–210.
D. DeGroot, and J Chang, “A Comparison of Two And-Parallel Execution Models,” Proc. AFCET Conf. on Hardware and Software Components and Architectures for the Fifth Generation, Paris, France, March 5–7, 1985.
D. DeGroot, “Logic Programming and Parallel Porcessing: A Tutorial,” 1985, unpublished.
M. de Hermenegildo, “An Abstract Machine for Restricted and-Parallel Execution of Logic Programs,” Proc. 3rd Int’l Conf. on Logic Programming, E. Shapiro, New York: Springer-Verlag, 1986, pp. 25–39.
Y-J. Lin and V. Kumar, “A Parallel Execution Scheme for Exploiting And-Parallelism of Logic Programs,” Proc. 1986 Int’l Conf. on Parallel Processing, K. Hwang, S. Jacobs, and E. Swartzlander, IEEE, pp. 972–975.
J. Lloyd, Foundations of Logic Programming. New York: Springer-Verlag, 1984.
G. H. Pollard, Parallel Execution of Horn Clause Programs. Ph.D. Thesis, University of London, Imperial College of Science and Technology, London, England, 1981.
Y-W. Tung, Parallel Processing Model for Logic Programming. Ph.D. Thesis, Dept. of Electrical Engineering, University of Southern California, May 1986.
D. Warren, An Abstract Prolog Instruction Set. Tech. Note 309, SRI International, Menlo Park, CA, October 1983.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers
About this chapter
Cite this chapter
DeGroot, D. (1988). Restricted and-Parallel Execution of Logic Programs. In: Kowalik, J.S. (eds) Parallel Computation and Computers for Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, vol 26. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1989-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1989-4_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9188-6
Online ISBN: 978-1-4613-1989-4
eBook Packages: Springer Book Archive