Abstract
An important extension of constraint technology involves problems that undergo changes that may invalidate the current solution. Previous work on dynamic problems sought methods for efficiently finding new solutions. We take a more proactive approach, exploring methods for finding solutions more likely to remain valid after changes that temporarily alter the set of valid assignments (stable solutions). To this end, we examine strategies for tracking changes in a problem and incorporating this information to guide search to solutions that are more likely to be stable. In this work search is carried out with a min-conflicts hill climbing procedure, and information about change is used to bias value selection, either by distorting the objective function or by imposing further criteria on selection. We study methods that track either value losses or constraint additions, and incorporate information about relative frequency of change into search. Our experiments show that these methods are generally effective in finding stable solutions, and in some cases handle the tradeof between solution stability and search efficiency quite well. In addition, we identify one condition in which these methods markedly reduce the effort to find a stable solution
supported by the National Science Foundation under Grant No. IRI-9504316
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Bessière. Arc-consistency in dynamic constraint satisfaction problems. In Proceedings AAAI-91, pp. 221–226, 1991.
M. Drummond, J. Bresina, and K. Swanson. Just-in-case scheduling. In Proceedings AAAI-94, pp. 1098–1104, 1994.
R. Dechter and A. Dechter. Belief maintenance in dynamic constraint networks. In Proceedings AAAI-88, pp. 37–42, 1988.
H. Fargier and J. Lang. Uncertainty in constraint satisfaction problems: a probabilistic approach. In M. Clarke, R. Kruse, and S. Moral, editors, Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU’93, LNCS volume 747, pp. 97–104. Springer-Verlag, Berlin, 1993.
W. L. Hays. Statistics for the Social Sciences (2nd Edit.). Holt, Rinehart and Winston, New York, NY, 1973.
G. Verfaillie and T. Schiex. Solution reuse in dynamic constraint satisfaction problems. In Proceedings AAAI-94, pp. 307–312, 1994.
R.J. Wallace. Analysis of heuristic methods for partial constraint satisfaction problems. In E. C. Freuder, editor, Principles and Practice of Constraint Programming-CP’96, LNCS Vol. 1118, pp. 482-496. Springer, Berlin, 1996.
R. J. Wallace and E. C. Freuder. Stable solutions for dynamic constraint satisfaction problems. In CP-97 Workshop on Theory and Practice of Dynamic Constraint Satisfaction, pp. 73–80, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wallace, R.J., Freuder, E.C. (1998). Stable Solutions for Dynamic Constraint Satisfaction Problems. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive