(This paper has been submitted to the Journal of Logic
Programming) A distributed AND parallel Prolog
implementation is described. The system can correctly handle all pure
Prolog program. In particular, it deals with the problem of
distributed backtracking. Conflicts in variable bindings are resolved
by assigning a time value to every unification. Bindings with smaller
time values are given precedence over those with larger time values.
The algorithm is based on the optimistic Time Warp system, with
Prolog-specific specializations. The result is a system which can
fully exploit both dependent and independent AND parallelism.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at firstname.lastname@example.org