Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40697
DC FieldValue
dc.titleSchedulers for rule-based constraint programming
dc.contributor.authorApt, K.R.
dc.contributor.authorBrand, S.
dc.date.accessioned2013-07-04T08:10:17Z
dc.date.available2013-07-04T08:10:17Z
dc.date.issued2003
dc.identifier.citationApt, 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.urihttp://scholarbank.nus.edu.sg/handle/10635/40697
dc.description.abstractWe 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.sourceScopus
dc.subjectConstraint propagation
dc.subjectRule-based programming
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings of the ACM Symposium on Applied Computing
dc.description.page14-21
dc.identifier.isiutNOT_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.