Speeding up constraint propagation
2004 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING: CP 2004, PROCEEDINGS / [ed] Wallace, M, BERLIN: SPRINGER , 2004, Vol. 3258, 619-633 p.Conference paper (Refereed)
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keeping track of which propagators are at fixpoint, and choosing which propagator to apply next. We show how idempotence reasoning and events help track fixpoints more accurately. We improve these methods by using them dynamically (taking into account current 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 which combine the effects of multiple propagators with priorities for greater efficiency.
Place, publisher, year, edition, pages
BERLIN: SPRINGER , 2004. Vol. 3258, 619-633 p.
, LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 3258
IdentifiersURN: urn:nbn:se:kth:diva-43961ISI: 000224107900045ScopusID: 2-s2.0-33750358743ISBN: 3-540-23241-9OAI: oai:DiVA.org:kth-43961DiVA: diva2:450983
10th International Conference on the Principles and Practice of Constraint Programming. Toronto, CANADA. SEP 27-OCT 01, 2004
QC 201110242011-10-242011-10-192011-11-01Bibliographically approved