Please use this identifier to cite or link to this item:
|Title:||Schedulers and redundancy for a class of constraint propagation rules|
|Citation:||Brand, S., Apt, K.R. (2005). Schedulers and redundancy for a class of constraint propagation rules. Theory and Practice of Logic Programming 5 (4-5) : 441-465. ScholarBank@NUS Repository. https://doi.org/10.1017/S1471068405002401|
|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 (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. © 2005 Cambridge University Press.|
|Source Title:||Theory and Practice of Logic Programming|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 15, 2019
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.