Memoization in Constraint Logic Programming

Simple item page
dc.creatorJohnson, Mark
dc.date1994-04-11
dc.date.accessioned2026-07-07T09:08:13Z
dc.date.available2026-07-07T09:08:13Z
dc.descriptionThis 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.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/cmp-lg/9404005
dc.identifierhttp://arxiv.org/abs/cmp-lg/9404005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/150645
dc.subjectComputation and Language
dc.titleMemoization in Constraint Logic Programming
dc.typetext

Files

Collections

arXiv