{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T04:49:23Z","timestamp":1775710163990,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf01531015","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:14:50Z","timestamp":1113869690000},"page":"327-351","source":"Crossref","is-referenced-by-count":158,"title":["Probability propagation"],"prefix":"10.1007","volume":"2","author":[{"given":"Glenn R.","family":"Shafer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash P.","family":"Shenoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic and Discrete Meth. 8 (1987) 277?284.","journal-title":"SIAM J. Algebraic and Discrete Meth."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"C. Beeri, R. Fagin, D. Maier and M. Yannakakis, On the desirability of acyclic database schemes, J. ACM 30 (1983 479?513.","journal-title":"J. ACM"},{"key":"CR3","unstructured":"C. Berge,Graphs and Hypergraphs, translated from French by E. Minieka (North-Holland, 1973)."},{"key":"CR4","unstructured":"U. Bertele and F. Brioschi,Nonserial Dynamic Programming (Academic Press, 1972)."},{"key":"CR5","unstructured":"L.S. Brownston, R.G. Farrell, E. Kant and N. Martin,Programming Expert Systems in OPS5: An Introduction to Rule-Based Programming (Addison-Wesley, 1985)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2307\/1426718","volume":"10","author":"C. Cannings","year":"1978","unstructured":"C. Cannings, E.A. Thompson and M.H. Skolnick, Probability functions on complex pedigrees, Advan. Appl. Probab. 10 (1978) 26?61.","journal-title":"Advan. Appl. Probab."},{"key":"CR7","first-page":"150","volume":"1","author":"R. Dechter","year":"1988","unstructured":"R. Dechter and J. Pearl, Tree-clustering schemes for constraint processing, in:Proc. 7th National Conf. on AI (AAAI-88), St. Paul, MN (1988) vol. 1, pp. 150?154.","journal-title":"Proc. 7th National Conf. on AI (AAAI-88)"},{"key":"CR8","volume-title":"Research Report S-125","author":"A.P. Dempster","year":"1988","unstructured":"A.P. Dempster, Construction and local computation aspects of network belief functions, Research Report S-125, Department of Statistics, Harvard University, Cambridge, MA (1988)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic,Algorithmic Graph Theory and Perfect Graphs (Academic Press, 1980).","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"CR10","unstructured":"D. Hunter, Parallel belief revision, in:Proc. 4th Workshop on Uncertainty in AI, Minneapolis, MN (1988) pp. 170?176."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0030-5073(73)90026-3","volume":"10","author":"C.W. Kelly III","year":"1973","unstructured":"C.W. Kelly III and S. Barclay, A general Bayesian model for hierarchical inference, Organizational Behavior and Human Performance 10 (1973) 388?304.","journal-title":"Organizational Behavior and Human Performance"},{"key":"CR12","volume-title":"Ph.D. Dissertation","author":"A. Kong","year":"1986","unstructured":"A. Kong, Multivariate belief functions and graphical models, Ph.D. Dissertation, Department of Statistics, Harvard University, Cambridge, MA (1986)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1017\/S1446788700027300","volume":"A36","author":"S.L. Lauritzen","year":"1984","unstructured":"S.L. Lauritzen, T.P. Speed and K. Vijayan, Decomposable graphs and hypergraphs, J. Austral. Math. Soc. A36 (1984) 12?29.","journal-title":"J. Austral. Math. Soc."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"B50","author":"S.L. Lauritzen","year":"1988","unstructured":"S.L. Lauritzen and D.J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems (with discussion), J. Roy. Statist. Soc. B50 (1988) 157?224.","journal-title":"J. Roy. Statist. Soc."},{"key":"CR15","unstructured":"D. Maier,The Theory of Relational Databases (Computer Science Press, 1983)."},{"key":"CR16","unstructured":"F.M. Malvestuto, Decomposing complex contingency tables to reduce storage requirements, in:Proc. 1986 Conf. on Computational Statistics (1986) pp. 66?71."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/00031305.1983.10482723","volume":"37","author":"R.J. Meinhold","year":"1983","unstructured":"R.J. Meinhold and N.D. Singpurwalla, Understanding the Kaiman filter, Am. Statist. 37 (1983) 241?288.","journal-title":"Am. Statist."},{"key":"CR18","volume-title":"Ph.D. Dissertation","author":"K. Mellouli","year":"1987","unstructured":"K. Mellouli, On the propagation of beliefs in networks using the Dempster-Shafer theory of evidence, Ph.D. Dissertation, School of Business, University of Kansas, Lawrence, KS (1987)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","volume":"29","author":"J. Pearl","year":"1986","unstructured":"J. Pearl, Fusion, propagation and structuring in belief networks, Artificial Intelligence 29 (1986) 241?288.","journal-title":"Artificial Intelligence"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D.J. Rose","year":"1970","unstructured":"D.J. Rose, Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32 (1970) 597?609.","journal-title":"J. Math. Anal. Appl."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"D.J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in:Graph Theory and Computing, ed. R.C. Read (Academic Press, 1973) pp. 183?217.","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"CR22","first-page":"338","volume":"1","author":"R. Seidel","year":"1981","unstructured":"R. Seidel, A new method for solving constraint satisfaction problems, in:Proc. 7th Int. Joint Conf. on AI (IJCAI-81), Vancouver, British Columbia, Canada (1981) vol. 1, pp. 338?342.","journal-title":"Proc. 7th Int. Joint Conf. on AI (IJCAI-81)"},{"key":"CR23","first-page":"55","volume":"8","author":"R.D. Shachter","year":"1987","unstructured":"R.D. Shachter and D. Heckerman, A backwards view for assessment, AI Magazine 8 (1987) 55?61.","journal-title":"AI Magazine"},{"key":"CR24","volume-title":"Working Paper no. 201","author":"G.R. Shafer","year":"1988","unstructured":"G.R. Shafer and P.P. Shenoy, Local computation in hypertrees, Working Paper no. 201, School of Business, University of Kansas, Lawrence, KS (1988)."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0888-613X(87)90024-7","volume":"1","author":"G.R. Shafer","year":"1987","unstructured":"G.R. Shafer, P.P. Shenoy and K. Mellouli, Propagating belief functions in qualitative Markov trees, Int. J. Approximate Reasoning 1 (1987) 349?400.","journal-title":"Int. J. Approximate Reasoning"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"P.P. Shenoy, A valuation-based language for expert systems, Int. J. of Approximate Reasoning (1989) 383?411.","DOI":"10.1016\/0888-613X(89)90009-1"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MEX.1986.4306979","volume":"1","author":"P.P. Shenoy","year":"1986","unstructured":"P.P. Shenoy and G.R. Shafer, Propagating belief functions using local computations, IEEE Expert 1 (1986) 43?52.","journal-title":"IEEE Expert"},{"key":"CR28","unstructured":"P.P. Shenoy and G.R. Shafer, An axiomatic framework for Bayesian and belief-function propagation, in:Proc. 4th Workshop on Uncertainty in Artificial Intelligence, St. Paul, MN (1988) pp. 307?314."},{"key":"CR29","volume-title":"Working Paper no. 208","author":"P.P. Shenoy","year":"1988","unstructured":"P.P. Shenoy and G.R. Shafer, Constraint propagation, Working Paper no. 208, School of Business, University of Kansas, Lawrence, KS (1988)."},{"key":"CR30","volume-title":"Working Paper no. 207","author":"P.P. Shenoy","year":"1988","unstructured":"P.P. Shenoy and G.R. Shafer, Axioms for discrete optimization using local computation, Working Paper no. 207, School of Business, University of Kansas, Lawrence, KS (1988)."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"P.P. Shenoy, G.R. Shafer and K. Mellouli, Propagation of belief functions: A distributed approach, in:Proc. 2nd Workshop on Uncertainty in AI, Philadelphia, PA (1986) pp. 249?260. Also in:Uncertainty in Artificial Intelligence, vol. 2, eds. J.F. Lemmer and L.N. Kanal (North-Holland, 1988) 325?335.","DOI":"10.1016\/B978-0-444-70396-5.50033-9"},{"key":"CR32","doi-asserted-by":"crossref","unstructured":"W. Spohn, Ordinal conditional functions: A dynamic theory of epistemic states, in:Causation in Decision, Belief Change, and Statistics, eds. W.L. Harper and B. Skyrms (D. Reidel Publishing Company, 1988) vol. 2, pp. 105?134.","DOI":"10.1007\/978-94-009-2865-7_6"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Computing 13 (1984) 566?579.","journal-title":"SIAM J. Computing"},{"key":"CR34","volume-title":"Working Paper no. 198","author":"L. Zhang","year":"1988","unstructured":"L. Zhang, Studies on finding hypertree covers for hypergraphs, Working Paper no. 198, School of Business, University of Kansas, Lawrence, KS (1988)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531015\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531015\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T19:41:37Z","timestamp":1735674097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01531015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":34,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF01531015"],"URL":"https:\/\/doi.org\/10.1007\/bf01531015","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}