Making exhaustive search programs deterministic
Proceedings on Third international conference on logic programming
Studies in Prolog architectures
Studies in Prolog architectures
Or-parallel execution models of prolog
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Efficient Management of Backtracking in AND-Parallelism
Proceedings of the Third International Conference on Logic Programming
Compiling OR-parallelism into AND-parallelism
Proceedings of the Third International Conference on Logic Programming
An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs
Proceedings of the Third International Conference on Logic Programming
Design decisions influencing the microarchitecture for a Prolog machine
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
The and/or process model for parallel interpretation of logic programs
The and/or process model for parallel interpretation of logic programs
An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel
Pipelined OR-parallelism architecture for parallel execution of Prolog
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Parallel execution of prolog programs: a survey
ACM Transactions on Programming Languages and Systems (TOPLAS)
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
Logic-Based Program Synthesis and Transformation
Non-strict independence-based program parallelization using sharing and freeness information
Theoretical Computer Science
| Hi-index | 0.00 |
Compilation techniques such as those portrayed by the Warren Abstract Machine (WAM) have greatly improved the speed of execution of logic programs. The research presented herein is geared towards providing additional performance to logic programs through the use of parallelism, while preserving the conventional semantics of logic languages. Two areas to which special attention is given are the preservation of sequential performance and storage efficiency, and the use of low overhead mechanisms for controlling parallel execution. Accordingly, the techniques used for supporting parallelism are efficient extensions of those which have brought high inferencing speeds to sequential implementations. At a lower level, special attention is also given to design and simulation detail and to the architectural implications of the execution model behavior. This paper offers an overview of the basic concepts and techniques used in the parallel design, simulation tools used, and some of the results obtained to date.