P-Prolog is put forward as an alternative proposal to the difficulties faced in the main research areas of parallel logic programmings, which have been studied. P-Prolog provides the advantages of guarded Horn clauses while retaining don't know non-determinism where required. This monograph presents also an or-tree model and an implementation scheme for it, to combine and- and or- parallelism with reasonable efficiency. The model and implementation scheme discussed can be applied to P-Prolog and other parallel logic languages.

PARLOG is a logic programming language designed for efficient implementation on parallel machines. It supports a declarative style of programming, combined with an execution mechanism that can exploit the parallel architectures which are already available. This book is a comprehensive study of the design, application, and implementation of PARLOG.

This monograph concentrates on the implementation of concurrent logic programming languages on loosely-coupled parallel computer architectures. Two different abstract models are also considered: a graph reduction based model and a more imperative approach. The design of a specialized instruction set is presented that is general enough to be used for the whole family of concurrent logic programming languages. In particular the language Parlog is concentrated upon because it is the most efficiently implementable of all the non-flat logic programming languages. Other issues arising from the implementation of a programming language are discussed, in particular the design of a load balancing scheme which deals with the large number of short-lived processes inherent in a correct language implementation. Detailed descriptions of all the data structures and synchronisation algorithms are also presented. Resource exhaustion is also discussed and handled within the implementations. Detailed performance results for both models of computation are given. From the material it should be possible for the reader to create an implementation.

For advanced courses in fifth generation languages and computer architecture in departments of computer science and computer engineering, this text begins with a review of logic programming and Prolog and moves on to discuss Prolog interpreters and abstract machines in depth and examine potential parallelism in logic programming and the stream parallel language Parlog, concurrent Prolog and GHC.

Highly parallel machines have been available for many years but, because advances in hardware have always outpaced progress in software development, designers and users of these machines have yet to realize their full potential. Until recently there have been few, if any, high-class parallel programming languages that could be implemented on the wide variety of parallel processing systems in use. This book helps to redress the balance by teaching programming techniques as well as performance analysis of parallel programming languages and architectures using logic programming; specifically, it focuses on the Prolog-like languages OR-parallel Prolog and AND-parallel FGHC. Parallel Logic Programmingbrings to light practical applications of a previously esoteric/theoretical area of parallel logic programming and is unique in presenting programming hand-in-hand with performance analysis of real empirical measurements. Its quantitative approach to symbolic parallel programming provides students and professionals with tools for implementing and critically evaluating larger projects. The book includes useful chapter summaries, programming projects, and a glossary.