Memoization in Constraint Logic Programming

Details Memoization in Constraint Logic Programming Memoization in Constraint Logic Programming

1994-04-11

arxiv.org/abs/cmp-lg/9404005v1

Computer Science

Computation and Language

11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Memoization in Constraint Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Memoization in Constraint Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memoization in Constraint Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560928