Efficient Constraint Propagation Engines
AuthorSchulte, C; Stuckey, PJ
Source TitleACM Transactions on Programming Languages and Systems
PublisherASSOC COMPUTING MACHINERY
University of Melbourne Author/sStuckey, Peter
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsSchulte, C. & Stuckey, P. J. (2008). Efficient Constraint Propagation Engines. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 31 (1), https://doi.org/10.1145/1452044.1452046.
Access StatusThis item is currently not available from this repository
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.
KeywordsComputer Software; Information Systems
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References