Towards Effective Parallel Logic Programming

Vítor Santos Costa, Inês de Castro Dutra, Felipe França, Marluce Pereira, Patrícia Vargas, Cláudio Geyer, Jorge Barbosa, Cristiano Costa, Priscila Lima, Fátima Dargan, António Branco, Juarez Muylaert Filho, Gopal Gupta, Enrico Pontelli, Manuel Correia, Ricardo Lopes, Ricardo Rocha and Fernando Silva

October 2001


One of the advantages of logic programming (LP) and constraint logic programming (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 important extension of LP, tabling. We then discuss how the process of solving a set of constraints can be divided by several workers. We conclude with ongoing work on language issues towards the multiparadigm language Holo.


  author =    {V. Santos Costa and I. Castro Dutra and F. França and M. Pereira and P. Vargas and C. Geyer
              and J. Barbosa and C. Costa and P. Lima and F. Dargam and A. Branco and J. Muylaert Filho and
              G. Gupta and E. Pontelli and M. Correia and R. Lopes and R. Rocha and F. Silva},
  title =     {{Towards Effective Parallel Logic Programming}},
  booktitle = {Proceedings of the Projects Evaluation Workshop ProTeM-CC 2001, International 
               Cooperation NSF/CNPq},
  pages =     {243--265},
  editor =    {N. Prugner and P. Lima and C. Costa},
  month =     {October},
  year =      {2001},
  publisher = {CNPq},
  address =   {Rio de Janeiro, Brazil},

Download Paper

PDF file