Perfect Derived Propagators
2008 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING / [ed] Stuckey, PJ, 2008, Vol. 5202, 571-575 p.Conference paper (Refereed)
When implementing a propagator for a constraint, one must decide about variants: When implementing min , should one also implement max ? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance. This paper shows how to use variable views to derive perfect propagator variants: derived propagators inherit essential properties such as correctness and domain and bounds completeness.
Place, publisher, year, edition, pages
2008. Vol. 5202, 571-575 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 5202
IdentifiersURN: urn:nbn:se:kth:diva-70426DOI: 10.1007/978-3-540-85958-1_44ISI: 000260041200044ScopusID: 2-s2.0-56449123103OAI: oai:DiVA.org:kth-70426DiVA: diva2:486331
14th International Conference on Principles and Practice of Constraint Programming (CP 2008). Sydney, AUSTRALIA. SEP 14-18, 2008
QC 201201312012-01-302012-01-302012-01-31Bibliographically approved