OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog
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.
Unable to display preview. Download preview PDF.
- [Hirakawa 83]Hirakawa,H.: ‘Chart Parsing in Concurrent Prolog', ICOT Technical Report TR-008, 1983Google Scholar
- [Kay 80]Kay,M.: ‘Algorithm Schemata and Data Structures in Syntactic Processing', Xerox Technical Report, 1980Google Scholar
- [Kowalski 79]Kowalski, R.: ‘Logic for Problem Solving', North Holland, New York 1979Google Scholar
- [Pereira 80]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, 1980Google Scholar
- [Shapiro 83]Shapiro,E.Y: ‘A Subset of Concurrent Prolog and Its Interpreter', ICOT Technical Report TR-003, 1983Google Scholar
- [Takeuchi 83]Takeuchi,A: ‘Let's Talk Concurrent Prolog', ICOT Technical Memo TM-0008, 1983Google Scholar
- [Turner 79]D.A.Turner: ‘A New Implementation Technique for Applicative Languages', Software-Practice and Experience, No.1, vol.9, 1979Google Scholar
- [Warren 80]Warren,D.H.: ‘Logic Programming and Compiler Writing', DAI Research Paper No.128, 1980Google Scholar