Extending partial deduction to tabled execution
Konstantinos Sagonas, Michaël Leuschel · ACM Computing Surveys · 1998
normally occur in PrologstyleSLD evaluation and avoids performing redundant subcomputations. As aresult, tabling significantly extends the range of applications of logic programming(LP). Moreover, because of the better termination and complexity properties oftabled execution, tabled-based systems such as XSB [Sagohas et al. 1994] make agood first step in fulfilling the promise of declarativeness: allow a programmer towrite problem specifications, and then