Constraint solving with constraint handling rules

被引:0
|
作者
Frühwirth, T [1 ]
机构
[1] Univ Munich, Inst Informat, D-80538 Munich, Germany
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We describe how constraints are solved in constraint logic programming. To describe the algorithms at a high, abstract level, we use Constraint Handling Rules (CHR), a declarative language extension especially designed for writing user-defined constraints. CHR consist of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this article, we assume some familiarity with Prolog.
引用
收藏
页码:14 / 30
页数:17
相关论文
共 50 条