View-Based Propagator Derivation
2014 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014, 2014, 938-942 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 abstract shows how to use views to derive propagator variants where derived propagators are perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators are developed, and the abstract sketches an implementation architecture for views that is independent of the underlying constraint programming system. Evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.
Place, publisher, year, edition, pages
2014. 938-942 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8656
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-158858DOI: 10.1007/978-3-319-10428-7_71ISI: 000345088200071ScopusID: 2-s2.0-84906247456ISBN: 978-3-319-10428-7; 978-3-319-10427-0OAI: oai:DiVA.org:kth-158858DiVA: diva2:781476
20th International Conference on the Principles and Practice of Constraint Programming (CP), SEP 08-12, 2014, Lyon, FRANCE
QC 201501162015-01-162015-01-122015-01-16Bibliographically approved