{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:11:43Z","timestamp":1743124303788,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404941"},{"type":"electronic","value":"9783540450627"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45062-7_19","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T02:14:10Z","timestamp":1283566450000},"page":"230-242","source":"Crossref","is-referenced-by-count":1,"title":["Decision Network Semantics of Branching Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Ken","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fowler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Dynamic Programming","author":"R.E. Bellman","year":"1957","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"19_CR2","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison- Wesley, Reading (1967)"},{"key":"19_CR3","unstructured":"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\u201363 (1988)"},{"issue":"2-3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0004-3702(90)90060-D","volume":"42","author":"G.F. Cooper","year":"1990","unstructured":"Cooper, G.F.: The computational complexity of probabilistic inference usingBayesian belief networks. Artificial Intelligence\u00a042(2-3), 348\u2013393 (1990)","journal-title":"Artificial Intelligence"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Dagum, P., Galper, A., Horvitz, E.: Dynamic network models for forecasting. In: Proceedings of UAI 1992, pp. 41\u201348 (1992)","DOI":"10.1016\/B978-1-4832-8287-9.50010-4"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-45349-0_38","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"D.W. Fowler","year":"2000","unstructured":"Fowler, D.W., Brown, K.N.: Branching constraint satisfaction problems for solutions robust under likely changes. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 500\u2013504. Springer, Heidelberg (2000)"},{"key":"19_CR7","unstructured":"Fowler, D.W.: Branching Constraint Satisfaction Problems. PhD Thesis, Department of Computing Science, University of Aberdeen (2002)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1021853506616","volume":"118","author":"D.W. Fowler","year":"2003","unstructured":"Fowler, D.W., Brown, K.N.: Branching constraint satisfaction problems and Markov decision problems compared. Annals of Operations Research\u00a0118, 85\u2013100 (2003)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E. Ignall","year":"1965","unstructured":"Ignall, E., Schrage, L.: Applications of the branch and bound technique to some flow-shop scheduling problems. Operations Research\u00a013(3), 400\u2013412 (1965)","journal-title":"Operations Research"},{"key":"19_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3502-4","volume-title":"Bayesian Networks and Decision Graphs","author":"F.V. Jensen","year":"2001","unstructured":"Jensen, F.V.: Bayesian Networks and Decision Graphs. Springer, New York (2001)"},{"key":"19_CR11","series-title":"Fundamental Algorithms","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn. Fundamental Algorithms, vol.\u00a01. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"19_CR12","unstructured":"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)"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S.L. Lauritzen","year":"1987","unstructured":"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)\u00a050, 157\u2013224 (1987)","journal-title":"Journal of the Royal Statistical Society (Series B)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0888-613X(01)00036-6","volume":"27","author":"P.J.F. Lucas","year":"2001","unstructured":"Lucas, P.J.F.: Bayesian model-based diagnosis. International Journal of Approximate Reasoning\u00a027, 99\u2013119 (2001)","journal-title":"International Journal of Approximate Reasoning"},{"key":"19_CR15","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman, San Mateo (1988)"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1287\/opre.34.6.871","volume":"34","author":"R.D. Shachter","year":"1986","unstructured":"Shachter, R.D.: Evaluating influence diagrams. Operation Research\u00a034(6), 871\u2013882 (1986)","journal-title":"Operation Research"},{"key":"19_CR17","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"},{"key":"19_CR18","volume-title":"Introduction to Graph Theory","author":"R.J. Wilson","year":"1979","unstructured":"Wilson, R.J.: Introduction to Graph Theory. Longman, Burnt Mill (1979)"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45062-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T14:36:16Z","timestamp":1740494176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-45062-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404941","9783540450627"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45062-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}