Please use this identifier to cite or link to this item:
|Title:||Schedulers for rule-based constraint programming|
|Authors:||Apt, K.R. |
|Citation:||Apt, K.R.,Brand, S. (2003). Schedulers for rule-based constraint programming. Proceedings of the ACM Symposium on Applied Computing : 14-21. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Proceedings of the ACM Symposium on Applied Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.