Memoization in Constraint Logic Programming
<|reference_start|>Memoization in Constraint Logic Programming: 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.<|reference_end|>
@article{johnson1994memoization,
    title={Memoization in Constraint Logic Programming},
    author={Mark Johnson (Brown University)},
    journal={arXiv preprint arXiv:cmp-lg/9404005},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9404005},
    primaryClass={cmp-lg cs.CL}
}