Abstract
Branching Constraint Satisfaction Problems (BCSPs) have been introduced to model dynamic resource allocation subject to constraints and uncertainty. We give BCSPs a formal probability semantics by showing how they can be mapped to a certain class of Bayesian decision networks. This allows us to describe logical and probabilistic constraints in a uniform fashion. We also discuss extensions to BCSPs and decision networks suggested by the relationship between the two formalisms.
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.
References
Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)
Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison- Wesley, Reading (1967)
Cooper, G.F.: A method for using belief networks as influence diagrams. In: Proceedings of the 4th Workshop on Uncertainty in Artificial Intelligence, pp. 55–63 (1988)
Cooper, G.F.: The computational complexity of probabilistic inference usingBayesian belief networks. Artificial Intelligence 42(2-3), 348–393 (1990)
Dagum, P., Galper, A., Horvitz, E.: Dynamic network models for forecasting. In: Proceedings of UAI 1992, pp. 41–48 (1992)
Fowler, D.W., Brown, K.N.: Branching constraint satisfaction problems for solutions robust under likely changes. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 500–504. Springer, Heidelberg (2000)
Fowler, D.W.: Branching Constraint Satisfaction Problems. PhD Thesis, Department of Computing Science, University of Aberdeen (2002)
Fowler, D.W., Brown, K.N.: Branching constraint satisfaction problems and Markov decision problems compared. Annals of Operations Research 118, 85–100 (2003)
Ignall, E., Schrage, L.: Applications of the branch and bound technique to some flow-shop scheduling problems. Operations Research 13(3), 400–412 (1965)
Jensen, F.V.: Bayesian Networks and Decision Graphs. Springer, New York (2001)
Knuth, D.E.: The Art of Computer Programming, 3rd edn. Fundamental Algorithms, vol. 1. Addison-Wesley, Reading (1997)
Larkin, D., Dechter, R.: Bayesian inference in the presence of determinism. In: Bishop, C.M., Frey, B.J. (eds.) Proceedings of the 9th International Workshop on Artificial Intelligence and Statistics, Key West, FL, January 3-6 (2003)
Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society (Series B) 50, 157–224 (1987)
Lucas, P.J.F.: Bayesian model-based diagnosis. International Journal of Approximate Reasoning 27, 99–119 (2001)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman, San Mateo (1988)
Shachter, R.D.: Evaluating influence diagrams. Operation Research 34(6), 871–882 (1986)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Wilson, R.J.: Introduction to Graph Theory. Longman, Burnt Mill (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, K., Lucas, P., Fowler, D. (2003). Decision Network Semantics of Branching Constraint Satisfaction Problems. In: Nielsen, T.D., Zhang, N.L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2003. Lecture Notes in Computer Science(), vol 2711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45062-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-45062-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40494-1
Online ISBN: 978-3-540-45062-7
eBook Packages: Springer Book Archive