Hello,

I am trying to find out more about how tabling is implemented in Ciao. A google search brought me to the paper "A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation” by Guzmán et al. (Link: http://link.springer.com/chapter/10.1007%2F978-3-540-89982-2_79 ) In it the authors mention that “all […] executions were performed using local scheduling”. This paper was written 8 years ago. Has Ciao’s tabling implementation changed since then or is it still the same?

Am I right to assume that Ciao uses the local scheduling strategy described in "Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies.“ by Freire et al. ?

Is there any other documentation available on how the tabling mechanism works apart from the first paper?

Thank you very much!

Lorenz