Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
View-Based Propagator Derivation
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. (SCALE)ORCID iD: 0000-0002-6283-7004
2014 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014, 2014, 938-942 p.Conference paper, Published 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 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.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8656
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-158858DOI: 10.1007/978-3-319-10428-7_71ISI: 000345088200071Scopus ID: 2-s2.0-84906247456ISBN: 978-3-319-10428-7; 978-3-319-10427-0 (print)OAI: oai:DiVA.org:kth-158858DiVA: diva2:781476
Conference
20th International Conference on the Principles and Practice of Constraint Programming (CP), SEP 08-12, 2014, Lyon, FRANCE
Note

QC 20150116

Available from: 2015-01-16 Created: 2015-01-12 Last updated: 2015-01-16Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Schulte, Christian

Search in DiVA

By author/editor
Schulte, Christian
By organisation
Software and Computer systems, SCS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf