基于规则的约束程序设计中的推理机
Schedulers for Rule-based Constraint Programming
摘要：
我们在这里研究的一类规则，自然出现在基于规则的约束编程的上下文中的机器人。我们系统地从Apt [2000]的通用迭代算法中推导出它们的调度器。我们将这项研究应用于Apt和Monfroy [2001]的所谓成员规则。这导致了一种实现，该实现为这些规则产生了比它们作为标准规则执行时更好的性能。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
