Memoization in Constraint Logic Programming

1994/04/11 by Mark Johnson, Johnson, Mark
Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #cmp-lg #cs.CL

paper · pdf · doi:10.48550/arxiv.cmp-lg/9404005

11 pages

arxiv created 1994/04/11 · arxiv updated 2009/11/30

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.

Related

• Constraint Logic Programming for Natural Language Processing
• Memoization of Coroutined Constraints
• Parsing and Generation with Tabulation and Compilation
• Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison
• Propositional Encoding of Constraints over Tree-Shaped Data