Schedulers for Rule-based Constraint Programming
数据结构与算法
2007-05-23 v1 编程语言
摘要
We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic iteration algorithm of Apt [2000]. We apply this study to so-called membership rules of Apt and Monfroy [2001]. This leads to an implementation that yields for these rules a considerably better performance than their execution as standard CHR rules.
引用
@article{arxiv.cs/0211019,
title = {Schedulers for Rule-based Constraint Programming},
author = {Krzysztof R. Apt and Sebastian Brand},
journal= {arXiv preprint arXiv:cs/0211019},
year = {2007}
}
备注
8 pages. To appear in Proc. ACM Symposium on Applied Computing (SAC) 2003