Memoization in Constraint Logic Programming

Abstract

Motivated by a natural language processing application, this paper shows how to extend memoization techniques for logic programs to constraint logic programming. The lemma table proof procedure presented here generalizes standard memoization proof procedures such as OLDT resolution by (i) allowing goals and constraints to be resolved in any order, (ii… (More)

Topics

1 Figure or Table

Slides referencing similar topics