arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0403037cs.DScs.PL
收藏

一类约束传播规则的构造与冗余

Schedulers and Redundancy for a Class of Constraint Propagation Rules

Sebastian Brand, Krzysztof R. Apt

摘要:

我们在这里研究的一类规则,自然出现在基于规则的约束编程的上下文中的机器人。我们从[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 a considerably better performance for these rules than their execution as standard CHR rules. Finally, we show how redundant rules can be identified and how appropriately reduced sets of rules can be computed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑