Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers, Dordrecht (2001)
Beldiceanu, N., Harvey, W., Henz, M., Laburthe, F., Monfroy, E., Müller, T., Perron, L., Schulte, C.: TRICS 2000. Technical Report TRA9/00, School of Computing, National University of Singapore (Sept. 2000)
Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)
Codognet, P., Diaz, D.: Compiling constraints in clp(FD). The Journal of Logic Programming 27(3), 185–226 (1996)
Granvilliers, L., Monfroy, E.: Implementing constraint propagation by composition of reductions. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 300–314. Springer, Heidelberg (2003)
Harvey, W.: Personal communication (April 2004)
Harvey, W., Stuckey, P.J.: Constraint representation for propagation. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 235–249. Springer, Heidelberg (1998)
ILOG S.A. ILOG Solver 5.0: Reference Manual. Gentilly, France (2000)
Intelligent Systems Laboratory. SICStus Prolog user’s manual, 3.11.1. Technical report, Swedish Institute of Computer Science (2004)
Laburthe, F.: CHOCO: implementing a CP kernel. In: Beldiceanu et al. [3], pp. 71–85
Lhomme, O., Gotlieb, A., Rueher, M.: Dynamic optimization of interval narrowing algorithms. The Journal of Logic Programming 37(1-3), 165–183 (1998)
Müller, T.: The Mozart constraint extensions reference (1999), Available from www.mozart-oz.org
Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI 1998), Madison, WI, USA, July 1998, pp. 359–366. AAAI Press/The MIT Press (1998)
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, WA, USA, vol. 1, pp. 362–367. AAAI Press, Menlo Park (1994)
Savéant, P.: Constraint reduction at the type level. In: Beldiceanu et al. [3], pp. 16–29
Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(FD). Journal of Logic Programming 37(1-3), 139–164 (1998)
Van Hentenryck, P., Simonis, H., Dincbas, M.: Constraint satisfaction using constraint logic programming. Artificial Intelligence 58, 113–159 (1992)
Wallace, M., Novello, S., Schimpf, J.: Eclipse: A platform for constraint logic programming. Technical report, IC-Parc, Imperial College, London, UK (1997)
Wallace, R.J., Freuder, E.C.: Ordering heuristics for arc consistency algorithms. In: Ninth Canadian Conference on Artificial Intelligence, Vancouver, Canada, pp. 163–169 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulte, C., Stuckey, P.J. (2004). Speeding Up Constraint Propagation. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive