Schedulers for rule-based constraint programming

Abstract

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. We apply this study to so-called membership rules of Apt and Monfroy. This leads to an implementation that yields for these rules a considerably better performance than their execution as standard CHR rules.