Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Schulte, C., & Tack, G. (2008). Perfect derived propagators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 571–575). https://doi.org/10.1007/978-3-540-85958-1_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
