Schedulers for Rule-based Constraint Programming
| dc.creator | Apt, Krzysztof R. | |
| dc.creator | Brand, Sebastian | |
| dc.date | 2002-11-15 | |
| dc.date.accessioned | 2026-07-07T03:19:00Z | |
| dc.date.available | 2026-07-07T03:19:00Z | |
| dc.description | 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. | |
| dc.description | 8 pages. To appear in Proc. ACM Symposium on Applied Computing (SAC) 2003 | |
| dc.identifier | https://arxiv.org/abs/cs/0211019 | |
| dc.identifier | http://arxiv.org/abs/cs/0211019 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31345 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Programming Languages | |
| dc.subject | I.2.2; I.2.3; D.3.3; D.3.4 | |
| dc.title | Schedulers for Rule-based Constraint Programming | |
| dc.type | text |