TY  - BOOK
AU  - Beaumont,A.
AU  - Gupta,G.
ED  - SpringerLink (Online service)
TI  - Parallel Execution of Logic Programs: ICLP '91 Pre-Conference Workshop Paris, June 24, 1991 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540466734
AV  - QA76.6-76.66 
U1  - 005.11 23
PY  - 1991///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Software engineering
KW  - Computer Science
KW  - Programming Techniques
KW  - Mathematical Logic and Formal Languages
KW  - Programming Languages, Compilers, Interpreters
KW  - Software Engineering
N1  - Debugging parallel Strand Programs -- Constraint handling, garbage collection and execution model issues in ElipSys -- Controlling search with meta-Brave -- Solving optimisation problems in the Aurora or-parallel Prolog system -- ?????: A Kernel Andorra Prolog -- A flexible scheduler for the Andorra-I system -- The Pandora abstract machine: An extension of JAM -- Performance of Muse on the BBN Butterfly TC2000 -- Scheduling strategies and speculative work -- Performance of competitive OR-parallelism -- ACE: And/or-parallel copying-based execution of logic programs -- Blackboard communication in Prolog -- Data parallelism in logic programming -- An efficient binding management in OR-parallel model
N2  - 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?
UR  - http://dx.doi.org/10.1007/3-540-55038-0
ER  -