Compiling enumerate-and-filter programs for efficient execution under committed-choice AND-parallelism

A technique and algorithms are presented for compilation of enumerate-and-filter logic programs for efficient execution under committed-choice AND-parallel logic programming languages. The compilation technique preserves the integration of OR-parallelism, AND-parallelism, and stream parallelism present in enumerate-and-filter programs. Algorithms are demonstrated by compiling enumerate-and-filter program in Flat Concurrent Prolog. Compilation of enumerate-and-filter construct improves the execution time by an order of magnitude. Comparison of the sequential Prolog version of compiled enumerate-and-filter programs and the 'setof' construct in Prolog demonstrates that efficiency is achieved without any extra runtime overhead