ML p(r)ior | Memoization in Constraint Logic Programming
Processing...

Memoization in Constraint Logic Programming

1994-04-11
9404005 | cmp-lg
This paper shows how to apply memoization (caching of subgoals and associated answer substitutions) in a constraint logic programming setting. The research is is motivated by the desire to apply constraint logic programming (CLP) to problems in natural language processing that involve (constraint) interleaving or coroutining, such as GB and HPSG parsing.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations