Memoization in Constraint Logic Programming
cmp-lg
2008-02-03 v1 计算与语言
摘要
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.
引用
@article{arxiv.cmp-lg/9404005,
title = {Memoization in Constraint Logic Programming},
author = {Mark Johnson},
journal= {arXiv preprint arXiv:cmp-lg/9404005},
year = {2008}
}
备注
11 pages