Abstract
We show how a new method for parallel logic programming, based on compilation of Tärnlund's inference system Reform, can be applied to the logic programming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion levels of a recursive program, including the head unifications at each level, are computed in parallel. We discuss criteria for when a program is amenable to this kind of parallel processing and describe parallel Reform Prolog solutions of some programming problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barklund, J. (1990) Parallel Unification, Ph.D. Thesis, Computing Science Dept., Uppsala University.
Clark, K. L. & S. Gregory (1983) PARLOG: a parallel logic programming language. Research report DOC 83/5, Dept. of Computing, Imperial College, London.
Fox, G. (1990) Talk given at a workshop on Massively Parallel Reasoning Systems, Syracuse, New York, December 1990.
Harrison III, W. L. (1989) The interprocedural analysis and automatic parallelization of Scheme programs. Lisp and Symbolic Computation 2, No. 3/4, 179–396.
Kowalski, R. A. (1974) Predicate logic as a computer language. In Information Processing 74, pp. 569–574. North-Holland, Amsterdam.
Larus, J. R. (1991) Compiling Lisp programs for parallel execution. Lisp and Symbolic Computation 4, No. 1, 29–99.
Millroth, H. (1990) Reforming Compilation of Logic Programs, Ph.D. Thesis, Computing Science Dept., Uppsala University. (Summary to appear at Int. Logic Programming Symp., San Diego, CA., October 1991)
Millroth, H. (1991) Compiling Reform, (to appear in) Massively Parallel Reasoning Systems (eds. J. A. Robinson & E. E. Siebert), MIT Press.
Mycroft, A. & R. A. O'Keefe (1984) A Polymorphic Type System for Prolog. Artificial Intelligence 23, No. 3, 295–307.
Naish, L. (1988) Parallelizing NU-Prolog. Proc. 5th Int. Conf./Symp. Logic Programming (eds. K. A. Bowen & R. A. Kowalski), Seattle, Washington.
O'Keefe, R. A. (1990) The Craft of Prolog. MIT Press, Cambridge, Mass.
Press, W. H.et al. (1989) Numerical Recepies. The Art of Scientific Computing. Cambridge U. P., Cambridge.
Shapiro, E. Y. (1983) A Subset of Concurrent Prolog and its Interpreter. Technical report TR-003, ICOT, Tokyo.
Tärnlund, S.-å. (1991) Reform, (to appear in) Massively Parallel Reasoning Systems (eds. J. A. Robinson & E. E. Siebert), MIT Press.
Tärnlund, S.-å, H. Millroth, J. Bevemyr, T. Lindgren & M. Veanes (1991) Perform: a Parallel Reform Machine, submitted for publication.
Ueda, K. (1986) Guarded Horn Clauses, Eng.D. Thesis, University of Tokyo.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Millroth, H. (1992). Using the Reform inference system for parallel Prolog. In: Fronhöfer, B., Wrightson, G. (eds) Parallelization in Inference Systems. Lecture Notes in Computer Science, vol 590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55425-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-55425-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55425-7
Online ISBN: 978-3-540-47066-3
eBook Packages: Springer Book Archive