Work

Memoization in Constraint Logic Programming

Year: 1994
Type: preprint
Abstract: 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.
Institution: Brown University
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W1829945204
Cites: 15
Cited by: 12
Related to: 10