Parallel Execution of Logic Programs: ICLP '91 Pre-Conference Workshop Paris, June 24, 1991 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Logic programming refers to execution of programs written in Horn logic. Among the advantages of this style of programming are its simple declarativeand procedural semantics, high expressive power and inherent nondeterminism. The papers included in this volume were presented at the Workshop on Parallel Logic Programming held in Paris on June 24, 1991, as part of the 8th International Conference on Logic Programming. The papers represent the state of the art in parallel logic programming, and report the current research in this area, including many new results. The three essential issues in parallel execution of logic programs which the papers address are: - Which form(s) of parallelism (or-parallelism, and-parallelism, stream parallelism, data-parallelism, etc.) will be exploited? - Will parallelism be explicitly programmed by programmers, or will it be exploited implicitly without their help? - Which target parallel architecture will the logic program(s) run on?

Author(s): Martin Gittins (auth.), A. Beaumont, G. Gupta (eds.)
Series: Lecture Notes in Computer Science 569
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1991

Language: English
Pages: 198
Tags: Programming Techniques; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Software Engineering

Debugging parallel Strand Programs....Pages 1-16
Constraint handling, garbage collection and execution model issues in ElipSys....Pages 17-28
Controlling search with meta-Brave....Pages 29-38
Solving optimisation problems in the Aurora or-parallel Prolog system....Pages 39-53
καππα: A Kernel Andorra Prolog....Pages 54-69
A flexible scheduler for the Andorra-I system....Pages 70-82
The Pandora abstract machine: An extension of JAM....Pages 83-103
Performance of Muse on the BBN Butterfly TC2000....Pages 104-119
Scheduling strategies and speculative work....Pages 120-131
Performance of competitive OR-parallelism....Pages 132-145
ACE: And/or-parallel copying-based execution of logic programs....Pages 146-158
Blackboard communication in Prolog....Pages 159-172
Data parallelism in logic programming....Pages 173-184
An efficient binding management in OR-parallel model....Pages 185-195