A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Achieving scalability in parallel tabled logic programs
2002
Proceedings 16th International Parallel and Distributed Processing Symposium
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming because it addresses some of most significant weaknesses of Prolog. Namely, it can guarantee termination for programs with the bounded term-size property. Tabled programs exhibit a more complex execution mechanism than traditional Prolog's left-to-right search with backtracking. The reason is that Prolog programs are highly
doi:10.1109/ipdps.2002.1015488
dblp:conf/ipps/RochaSC02
fatcat:7onqcablqbhn5gfshsnvia7c5i