Change search
ReferencesLink to record
Permanent link

Direct link
Perfect Derived Propagators
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.ORCID iD: 0000-0002-6283-7004
2008 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING / [ed] Stuckey, PJ, 2008, Vol. 5202, 571-575 p.Conference paper (Refereed)
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 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
National Category
Computer Science
URN: urn:nbn:se:kth:diva-70426DOI: 10.1007/978-3-540-85958-1_44ISI: 000260041200044ScopusID: 2-s2.0-56449123103OAI: diva2:486331
14th International Conference on Principles and Practice of Constraint Programming (CP 2008). Sydney, AUSTRALIA. SEP 14-18, 2008
QC 20120131Available from: 2012-01-30 Created: 2012-01-30 Last updated: 2012-01-31Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Schulte, Christian
By organisation
Electronic, Computer and Software Systems, ECS
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: 7 hits
ReferencesLink to record
Permanent link

Direct link