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
Propagator Groups
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.ORCID iD: 0000-0002-6283-7004
2009 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING / [ed] Gent IP, 2009, Vol. 5732, 524-538 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constraint programming system to program how propagators within a group are executed. The paper exemplifies propagator groups for controlling both propagation order and propagator interaction. Controlling propagation order is applied to debugging constraint propagation and optimal constraint propagation for Berge-acyclic propagator graphs. Controlling propagator interaction by encapsulating failure and entailment is applied to general reification and constructive disjunction. The paper describes an implementation of propagator groups (based on Gecode) that is applicable to any propagator-centered constraint programming system. Experiments show that groups incur little to no overhead and that the applications of groups axe practically usable and efficient.

Place, publisher, year, edition, pages
2009. Vol. 5732, 524-538 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5732
Keyword [en]
Constraint programming systems, Constraint propagation, Optimal constraint, Computer programming
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-30346DOI: 10.1007/978-3-642-04244-7_42ISI: 000273241200039Scopus ID: 2-s2.0-70350397559ISBN: 978-3-642-04243-0 (print)OAI: oai:DiVA.org:kth-30346DiVA: diva2:401616
Conference
15th International Conference on Principles and Practice of Constraint Programming (CP 2009), Lisbon, PORTUGAL, SEP 20-24, 2009
Note
QC 20110303Available from: 2011-03-03 Created: 2011-02-24 Last updated: 2011-03-03Bibliographically 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
Lagerkvist, Mikael ZayenzSchulte, Christian
By organisation
Software and Computer Systems, SCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 26 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