Towards Effective Parallel Logic Programming

One of the advantages of logic programming (LP) and constraint logic pro-gramming (CLP) is the fact that one can exploit implicit parallelism in logic programs. Logic programs have two major forms of implicit parallelism: or-parallelism (ORP) and and-parallelism (ANDP). In this work we survey some of work that has been taking place within the CLoP n project towards fast execution of logic programs. We first briefly present our work in comparing several data representations for ORP: copying, copy-on-write, and the sparse binding array. Next, we demonstrate the usefulness of ORP concepts in the context of an impor-tant extension of LP, tabling. We then discuss how the process of solving a set of constraints can be dividided by several workers. We conclude with ongoing work on language issues towards the multiparadigm language Holo.