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.
CITATION STYLE
Fowler, D. W., & Brown, K. N. (2000). Branching constraint satisfaction problems for solutions robust under likely changes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1894, pp. 500–504). Springer Verlag. https://doi.org/10.1007/3-540-45349-0_38
Mendeley helps you to discover research relevant for your work.