Abstract
This paper describes a computational model of an OR-Parallel Optimizing Prolog System (POPS) based on a graph-reduction mechanism and multi-processing. POPS has the following features: 1) Programs are executed in OR-Parallel. 2) The same subcomputations are shared. 3) Left recursive rules can be handled without entering an infinite loop. At present, POPS is implemented in Concurrent Prolog supporting AND-Parallel execution and process synchronization mechanisms. This implementation shows that the OR-parallel execution of a logic program can be achieved by an AND-parallel execution mechanism.
Preview
Unable to display preview. Download preview PDF.
References
Hirakawa,H.: ‘Chart Parsing in Concurrent Prolog', ICOT Technical Report TR-008, 1983
Kay,M.: ‘Algorithm Schemata and Data Structures in Syntactic Processing', Xerox Technical Report, 1980
Kowalski, R.: ‘Logic for Problem Solving', North Holland, New York 1979
Pereira,F. and Warren,D.H.: ‘Definite Clause Grammar for Language Analysis — Survey of the Formalism and a Comparison with Augmented Transition Networks', Artificial Intelligence, 13, 1980
Shapiro,E.Y: ‘A Subset of Concurrent Prolog and Its Interpreter', ICOT Technical Report TR-003, 1983
Takeuchi,A: ‘Let's Talk Concurrent Prolog', ICOT Technical Memo TM-0008, 1983
D.A.Turner: ‘A New Implementation Technique for Applicative Languages', Software-Practice and Experience, No.1, vol.9, 1979
Warren,D.H.: ‘Logic Programming and Compiler Writing', DAI Research Paper No.128, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirakawa, H., Onai, R., Furukawa, K. (1986). OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog. In: Goto, E., Araki, K., Yuasa, T. (eds) RIMS Symposia on Software Science and Engineering II. Lecture Notes in Computer Science, vol 220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16470-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-16470-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16470-8
Online ISBN: 978-3-540-39809-7
eBook Packages: Springer Book Archive