2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31345We 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.8 pages. To appear in Proc. ACM Symposium on Applied Computing (SAC) 2003Data Structures and AlgorithmsProgramming LanguagesI.2.2; I.2.3; D.3.3; D.3.4text