Donald Bren School of Information and Computer Sciences

Logic programs offer many opportunities for parallelism. We present two models of computation which allow parallel processing of Prolog programs. In the goal list model each processor is given a separate approach to the problem. In the AND/OR model each processor is given a separate subcomputation. Each model allows an arbitrary number of processors, and both perform the same sequence of unifications as would the standard depth first interpreter for Prolog if only one processor were available. In each model the parallelism is achieved as a result of the non-determinism in the program.