Change search
ReferencesLink to record
Permanent link

Direct link
View-based propagator derivation
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0002-6283-7004
National ICT Australia (NICTA), Faculty of Information Technology, Monash Universit.
2013 (English)In: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 18, no 1, 75-107 p.Article in journal (Refereed) Published
Abstract [en]

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max Should one implement linear constraints both with unit and non-unit coefficients Constraint variants are ubiquitous: implementing them requires considerable (if not prohibitive) effort and decreases maintainability, but will deliver better performance than resorting to constraint decomposition. This paper shows how to use views to derive propagator variants, combining the efficiency of dedicated propagator implementations with the simplicity and effortlessness of decomposition. A model for views and derived propagators is introduced. Derived propagators are proved to be perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators such as transformation, generalization, specialization, and type conversion are developed. The paper introduces an implementation architecture for views that is independent of the underlying constraint programming system. A detailed 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
Springer, 2013. Vol. 18, no 1, 75-107 p.
Keyword [en]
Constraint propagation, Constraint solver implementation, Parametric propagators, Views
National Category
Computer Science
URN: urn:nbn:se:kth:diva-107405DOI: 10.1007/s10601-012-9133-zISI: 000312879500004ScopusID: 2-s2.0-84871922124OAI: diva2:575808
Swedish Research Council, 621-2004-4953

QC 20130115

Available from: 2012-12-11 Created: 2012-12-11 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full

Search in DiVA

By author/editor
Schulte, Christian
By organisation
Software and Computer systems, SCS
In the same journal
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 56 hits
ReferencesLink to record
Permanent link

Direct link