Perfect Derived Propagators
Christian Schulte, Guido Tack.
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.
In: Peter J. Stuckey, editor, Fourteenth International Conference on Principles and Practice of Constraint Programming, Sydney, Australia, volume 5202 of Lecture Notes in Computer Science, pages 571-575. Springer-Verlag, September, 2008. DOI 10.1007/978-3-540-85958-1_44.
Copyright Springer-Verlag, the original publication is available at www.springerlink.com