{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:15Z","timestamp":1725664275238},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601128"},{"type":"electronic","value":"9783540494386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60112-0_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:40:50Z","timestamp":1330278050000},"page":"251-258","source":"Crossref","is-referenced-by-count":0,"title":["Bayesian approximation and invariance of Bayesian belief functions"],"prefix":"10.1007","author":[{"given":"A. V.","family":"Joshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. C.","family":"Sahasrabudhe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"unstructured":"Barnett, J.: Computational methods for a mathematical theory of evidence, in Proceedings IJCAI-81, Vancouver, BC (1981) 868\u2013875.","key":"29_CR1"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0888-613X(90)90015-T","volume":"4","author":"D. Dubois","year":"1990","unstructured":"Dubois, D., Prade, H.: Consonant approximations of belief functions. Int. J. Approx. Reasoning. 4 (1990) 419\u2013449.","journal-title":"Int. J. Approx. Reasoning"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0004-3702(85)90064-5","volume":"26","author":"J. Gordon","year":"1985","unstructured":"Gordon, J., Shortliffe, E.: A method for managing evidential reasoning in a hierarchical hypothesis space. Artificial Intelligence. 26 (1985) 323\u2013357.","journal-title":"Artificial Intelligence"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science. 521","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BFb0028102","volume-title":"Uncertainty in Knowledge Bases","author":"R. Kennes","year":"1991","unstructured":"Kennes, R., Smets, P.: Fast algorithms for Dempster-Shafer theory, in: Bouchon-Meunier B., Yager R.R., and Zadeh L. (eds.) Uncertainty in Knowledge Bases. Lecture Notes in Computer Science. 521 (Springer, Berlin, 1991) 14\u201323."},{"key":"29_CR5","first-page":"401","volume-title":"Uncertainty in Artificial Intelligence. 6","author":"R. Kennes","year":"1991","unstructured":"Kennes, R., Smets, P.: Computational aspects of the m\u00f6bius transformation, in: Bonnisonne P.P., Henrion M., Kanal L.N. and Lemmer J.F. (eds.) Uncertainty in Artificial Intelligence. 6 (North-Holland, Amsterdam, 1991) 401\u2013416."},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science. 521","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0028146","volume-title":"Uncertainty in Knowledge Bases","author":"J. Kohlas","year":"1991","unstructured":"Kohlas, J., Monney, P.: Propagating belief functions through constraints system, in: Bouchon-Meunier B., Yager R.R., and Zadeh L. (eds.) Uncertainty in Knowledge Bases. Lecture Notes in Computer Science. 521 (Springer, Berlin, 1991) 50\u201357."},{"key":"29_CR7","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214696","volume-title":"A Mathematical Theory of Evidence","author":"G. Shafer","year":"1976","unstructured":"Shafer, G.: A Mathematical Theory of Evidence (Princeton University Press, Princeton, NJ, 1976)."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0004-3702(87)90040-3","volume":"33","author":"G. Shafer","year":"1987","unstructured":"Shafer, G., Logan, R.: Implementing Dempster's rule for hierarchical evidence. Artificial Intelligence. 33 (1987) 271\u2013298.","journal-title":"Artificial Intelligence"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0888-613X(87)90024-7","volume":"1","author":"G. Shafer","year":"1987","unstructured":"Shafer, G.,Shenoy, P., Mellouli, K.: Propagating belief functions in qualitative markov trees. Int. J. Approx. Reasoning. 1, (1987) 349\u2013400.","journal-title":"Int. J. Approx. Reasoning."},{"issue":"3","key":"29_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MEX.1986.4306979","volume":"1","author":"P. Shenoy","year":"1986","unstructured":"Shenoy, P., Shafer, G.: Propagating belief functions with local computations, IEEE Expert. 1:3 (1986) 43\u201352.","journal-title":"IEEE Expert"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science. 313","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-19402-9_51","volume-title":"Uncertainty and Intelligent Systems","author":"P. Smets","year":"1988","unstructured":"Smets, P.: Belief functions versus probability functions, in: Bouchon B., Saitta L. and Yager R. (eds.) Uncertainty and Intelligent Systems. Lecture Notes in Computer Science. 313 (Springer, Berlin, 1988) 17\u201324."},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/B978-0-444-88738-2.50010-5","volume-title":"Uncertainty in Artificial Intelligence. 5","author":"P. Smets","year":"1990","unstructured":"Smets, P.: Constructing the pignistic probability function in a context of uncertainty, in: Henrion M., Shachter R.D., Kanal L.N. and Lemmer J.F. (eds.) Uncertainty in Artificial Intelligence. 5 (North-Holland, Amsterdam, 1990) 29\u201339."},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0004-3702(93)90072-J","volume":"61","author":"B. Tessem","year":"1993","unstructured":"Tessem, B.: Approximations for efficient computation in the theory of evidence. Artificial Intelligence. 61 (1993) 315\u2013329.","journal-title":"Artificial Intelligence"},{"key":"29_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0020-7373(89)80032-X","volume":"30","author":"F. Voorbraak","year":"1989","unstructured":"Voorbraak, F.: A computationally efficient approximation of Dempster-Shafer theory. Int. J. Man-Mach. Stud. 30 (1989) 525\u2013536.","journal-title":"Int. J. Man-Mach. Stud."},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0888-613X(92)90031-T","volume":"6","author":"N. Wilson","year":"1992","unstructured":"Wilson, N.: The combination of belief: when and how fast?, Int. J. Approx. Reasoning. 6 (May 1992) 377\u2013388.","journal-title":"Int. J. Approx. Reasoning."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning and Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60112-0_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:23:45Z","timestamp":1640942625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60112-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601128","9783540494386"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60112-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}