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
Efficient Constraint Propagation Engines
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.ORCID iD: 0000-0002-6283-7004
2008 (English)In: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, E-ISSN 1558-4593, Vol. 31, no 1, 2- p.Article in journal (Refereed) Published
Abstract [en]

This article presents a model and implementation techniques for speeding up constraint propagation. Three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping track of which propagators are at fixpoint, choosing which propagator to apply next, and how to combine several propagators for the same constraint. We show how idempotence reasoning and events help track fixpoints more accurately. We improve these methods by using them dynamically (taking into account current variable domains to improve accuracy). We define priority-based approaches to choosing a next propagator and show that dynamic priorities can improve propagation. We illustrate that the use of multiple propagators for the same constraint can be advantageous with priorities, and introduce staged propagators that combine the effects of multiple propagators with priorities for greater efficiency.

Place, publisher, year, edition, pages
New York: ASSOC COMPUTING MACHINERY , 2008. Vol. 31, no 1, 2- p.
Keyword [en]
Languages, Design, Experimentation, Performance, Constraint (logic) programming, constraint propagation, events, finite domain constraints, fixpoint reasoning, priorities
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-31567DOI: 10.1145/1452044.1452046ISI: 000262394800002Scopus ID: 2-s2.0-57949102453OAI: oai:DiVA.org:kth-31567DiVA: diva2:405059
Conference
10th International Conference on the Principles and Practice of Constraint Programming Toronto, CANADA, SEP 27-OCT 01, 2004
Note
QC 20110321Available from: 2011-03-21 Created: 2011-03-18 Last updated: 2017-12-11Bibliographically 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
In the same journal
ACM Transactions on Programming Languages and Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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