Or-Parallelism within Tabling

Ricardo Rocha, Fernando Silva and VĂ­tor Santos Costa

January 1999


One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficiently exploited in tabling systems and propose two alternative approaches, Or-Parallelism within Tabling (OPT) and Tabling within Or-Parallelism (TOP). We concentrate on the fundamental concepts of an environment copying based model to implement the OPT approach and introduce the data structures and algorithms necessary to extend the YapOr Or-Parallel system, in order to obtain a parallel tabling system.


  author =    {R. Rocha and F. Silva and V. Santos Costa},
  title =     {{Or-Parallelism within Tabling}},
  booktitle = {Proceedings of the 1st International Workshop on Practical Aspects of Declarative 
               Languages (PADL 1999)},
  pages =     {137--151},
  number =    {1551},
  series =    {LNCS},
  publisher = {Springer},
  editor =    {G. Gupta},
  month =     {January},
  year =      {1999},
  address =   {San Antonio, Texas, USA},

Download Paper

PDF file

Download Slides

PDF file