Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/40697
DC Field | Value | |
---|---|---|
dc.title | Schedulers for rule-based constraint programming | |
dc.contributor.author | Apt, K.R. | |
dc.contributor.author | Brand, S. | |
dc.date.accessioned | 2013-07-04T08:10:17Z | |
dc.date.available | 2013-07-04T08:10:17Z | |
dc.date.issued | 2003 | |
dc.identifier.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. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/40697 | |
dc.description.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. | |
dc.source | Scopus | |
dc.subject | Constraint propagation | |
dc.subject | Rule-based programming | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.sourcetitle | Proceedings of the ACM Symposium on Applied Computing | |
dc.description.page | 14-21 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.