Abstract
Invariants that incrementally maintain the value of expressions under assignments to their variables are a natural abstraction to build high-level local search algorithms. But their functionalities are not sufficient to allow arbitrary expressions as constraints or objective functions as in constraint programming. Differentiable invariants bridge this expressiveness gap. A differentiable invariant maintains the value of an expression and its variable gradients, it supports differentiation to evaluate the effect of local moves. The benefits of differentiable invariants are illustrated on a number of applications which feature complex, possibly reified, expressions and whose models are essentially similar to their CP counterparts. Experimental results demonstrate their practicability.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agren, M., Flener, P., Pearson, J.: Inferring Variable Conflicts for Local Search. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, Springer, Heidelberg (2006)
Gomes, C., Sellmann, M., van Es1, C., van Es, H.: The Challenge of Generating Spatially Balanced Scientific Experiment Designs. In: CP-AI-OR 2004, Nice (2004)
Michel, L., Van Hentenryck, P.: Localizer: A Modeling Language for Local Search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, Springer, Heidelberg (1997)
Michel, L., Van Hentenryck, P.: Localizer. Constraints 5, 41–82 (2000)
Michel, L., Van Hentenryck, P.: A Constraint-Based Architecture for Local Search. In: OOPSLA 2002 (November 2002)
Smith, C., Gomes, C., Fernàndez, C.: Streamlining Local Search for Spatially Balanced Latin Squares. In: IJCAI 2005, Edinburgh, Scotland (July 2005)
Van Hentenryck, P.: Constraint and Integer Programming in OPL. Informs Journal on Computing 14(4), 345–372 (2002)
Van Hentenryck, P.: Constraint-Based Local Search. The MIT Press, Cambridge (2005)
Van Hentenryck, P., Michel, L., Liu, L.: Constraint-Based Combinators for Local Search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 47–61. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Hentenryck, P., Michel, L. (2006). Differentiable Invariants. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_43
Download citation
DOI: https://doi.org/10.1007/11889205_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)