Abstract
Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make decisions in the present that will be robust in the light of future events. We introduce the branching CSP to model these situations, incorporating some elements of decision theory, and describe an algorithm for its solution that combines forward checking with branch and bound search. We also examine a simple thresholding method which can be used in conjunction with the forward checking algorithm, and we show the trade-off between time and solution quality.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Bistarelli, U. Montanari, and F. Rossi. Constraint solving over semirings. In Proceedings of IJCAI-95, pages 624–630, 1995.
M. Drummond, J. Bresina, and K. Swanson. Just-in-case scheduling. In Proceedings of AAAI-94, Seattle, Washington, USA, 1994.
R. Dechter and A. Dechter. Belief maintenance in dynamic constraint networks. In Proceedings of AAAI-88, pages 37–43, 1988.
D. W. Fowler and K. N. Brown. Branching constraint satisfaction problems. Technical report, Dept. of Computing Science, Univ. of Aberdeen, 2000.
H. Fargier, J. Lang, and T. Schiex. Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In Proceedings of AAAI-96, Portland, OR, 1996.
E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.
M. L. Ginsberg, A. J. Parkes, and A. Roy. Supermodels and robustness. In AAAI-98, pages 334–339, 1998.
R. J. Wallace and E. C. Freuder. Stable solutions for dynamic constraint satisfaction problems. In Workshop on The Theory and Practice of Dynamic Constraint Satisfaction, Salzburg, Austria, November 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fowler, D.W., Brown, K.N. (2000). Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_38
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive