Global Storing Mechanisms for Tabled Evaluation

Jorge Costa and Ricardo Rocha

December 2008


Arguably, the most successful data structure for tabling is tries. However, while tries are very efficient for variant based tabled evaluation, they are limited in their ability to recognize and represent repeated terms in different tabled calls or/and answers. In this paper, we propose a new design for the table space where tabled terms are stored in a common global trie instead of being spread over several different tries.


  author =    {J. Costa and R. Rocha},
  title =     {{Global Storing Mechanisms for Tabled Evaluation}},
  booktitle = {Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)},
  pages =     {708--712},
  number =    {5366},
  series =    {LNCS},
  publisher = {Springer},
  editor =    {M. Garcia de la Banda and E. Pontelli},
  month =     {December},
  year =      {2008},
  address =   {Udine, Italy},

Download Paper

PDF file

Download Slides

PDF file

Download Poster

PDF file