Executing Bounded Quantifications on Shared Memory Multiprocessors

We present a schema for executing bounded quantifications on shared memory multiprocessors, using the WAM-based abstract machine designed for recursion parallel execution developed by Bevemyr, Lindgren and Millroth. Preliminary results indicate almost linear speed-up on 24 processors for some quantified expressions. The parallelization overhead is low, in the order of 10–15%.

[1]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Jonas Barklund,et al.  Parallel bounded quantification—preliminary results , 1993, SIGP.

[3]  Håkan Millroth.  Reforming Compilation of Logic Programs , 1991, ISLP.

[4]  Lee Naish.  Parallelizing NU-Prolog , 1988, ICLP/SLP.

[5]  Håkan Millroth,et al.  Reform Prolog: The Language and Its Implementation , 1993, ICLP.

[6]  Andrei Voronkov,et al.  Logic Programming with Bounded Quantifiers , 1990, RCLP.