{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T02:49:24Z","timestamp":1712458164948},"reference-count":66,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0888-613x(90)90016-u","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:29:01Z","timestamp":1056979741000},"page":"451-495","source":"Crossref","is-referenced-by-count":42,"title":["A logic-based analysis of Dempster-Shafer theory"],"prefix":"10.1016","volume":"4","author":[{"given":"Gregory M.","family":"Provan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0888-613X(90)90016-U_BIB1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/TR.1979.5220476","article-title":"An improved method for network reliability","volume":"R-28","author":"Abraham","year":"1979","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Alg. Desc. Method"},{"key":"10.1016\/0888-613X(90)90016-U_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0165-0114(87)90110-2","article-title":"Evidential support logical programming","volume":"24","author":"Baldwin","year":"1985","journal-title":"Fuzzy Sets Syst."},{"key":"10.1016\/0888-613X(90)90016-U_BIB4","first-page":"275","article-title":"Computational Complexity of Network Reliability Analysis: an overview","volume":"R-35","author":"Ball","year":"1986","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB5","series-title":"Proceeding, International Joint Conference on Artificial Intelligence","first-page":"868","article-title":"Computational methods for a mathematical theory of evidence","author":"Barnett","year":"1981"},{"key":"10.1016\/0888-613X(90)90016-U_BIB6","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TR.1987.5222298","article-title":"An improved Abraham method for generating disjoint sums","volume":"R-36","author":"Beichelt","year":"1987","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB7","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0888-613X(90)90016-U_BIB8","series-title":"Logical Foundations of Probability","author":"Carnap","year":"1962"},{"key":"10.1016\/0888-613X(90)90016-U_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(78)90168-1","article-title":"On the number of prime implicants","volume":"24","author":"Chandra","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0888-613X(90)90016-U_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1119\/1.1990764","article-title":"Probability, frequency and reliable expectation","volume":"14","author":"Cox","year":"1946","journal-title":"Am. J. Physics"},{"key":"10.1016\/0888-613X(90)90016-U_BIB11","series-title":"AAAI Uncertainty in Artificial Intelligence Workshop","first-page":"386","article-title":"Combining symbolic and numeric approaches to uncertainty management","author":"D'Ambrosio","year":"1987"},{"key":"10.1016\/0888-613X(90)90016-U_BIB12","series-title":"Theory of Probability","author":"de Finetti","year":"1974"},{"key":"10.1016\/0888-613X(90)90016-U_BIB13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An assumption-based TMS","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(87)90063-4","article-title":"Diagnosing multiple faults","volume":"32","author":"de Kleer","year":"1987","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0888-613X(90)90016-U_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB16","series-title":"Proceedings of the American Association for Artificial Intelligence","article-title":"Tree clustering schemes for constraint processing","author":"Dechter","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB17","article-title":"Upper and lower probability bounds","author":"Dempster","year":"1968","journal-title":"J. Roy. Stat. Soc."},{"key":"10.1016\/0888-613X(90)90016-U_BIB18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","article-title":"A truth maintenance system","volume":"12","author":"Doyle","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB19","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0888-613X(90)90015-T","article-title":"Consonant Approximations of Belief Functions","volume":"4","author":"Dubois","year":"1990","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/0888-613X(90)90016-U_BIB20","series-title":"Proceedings, International Joint Conference on Artificial Intelligence","first-page":"1161","article-title":"Uncertainty, belief and probability","author":"Fagin","year":"1989"},{"key":"10.1016\/0888-613X(90)90016-U_BIB21","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TR.1987.5222437","article-title":"Improved bounds for system-failure probability","volume":"R-36","author":"Fong","year":"1987","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TCT.1973.1083657","article-title":"Boolean algebra method for computing the terminal reliability in a communications network","volume":"CT-20","author":"Fratta","year":"1973","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"3","key":"10.1016\/0888-613X(90)90016-U_BIB23","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TCOM.1965.1089137","article-title":"Applications of topological methods to probabilistic communications networks","volume":"13","author":"Fu","year":"1965","journal-title":"IEEE Trans. Commun. Technol."},{"key":"10.1016\/0888-613X(90)90016-U_BIB24","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0004-3702(85)90064-5","article-title":"A method for managing evidential reasoning in a hierarchical hypothesis space","volume":"26","author":"Gordon","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB25","series-title":"Proceeding, 1979 Computer Networking Symposium","first-page":"17","article-title":"A new algorithm for network reliability computation","author":"Grnarov","year":"1979"},{"key":"10.1016\/0888-613X(90)90016-U_BIB26","series-title":"The Principles and Applications of Decision Analysis","first-page":"760","article-title":"Influence diagrams","author":"Howard","year":"1981"},{"key":"10.1016\/0888-613X(90)90016-U_BIB27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/34.3885","article-title":"A statistical viewpoint on the theory of evidence","author":"Hummel","year":"1988","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/0888-613X(90)90016-U_BIB28","series-title":"Proc. STOC '88","first-page":"235","article-title":"Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved","author":"Jerrum","year":"1988"},{"issue":"4","key":"10.1016\/0888-613X(90)90016-U_BIB29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TR.1972.5215997","article-title":"A method for computing complex system reliability","volume":"R-21","author":"Kim","year":"1972","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB30","article-title":"Multivariate belief functions and belief functions","author":"Kong","year":"1986"},{"key":"10.1016\/0888-613X(90)90016-U_BIB31","first-page":"44","article-title":"On the lower estimate of the length of the shortest disjunctive normal forms for almost all Boolean functions","volume":"19","author":"Kuznetsov","year":"1983","journal-title":"Veroiatn. Metod. Kibern."},{"key":"10.1016\/0888-613X(90)90016-U_BIB32","series-title":"Proceedings of the American Association for Artificial Intelligence","first-page":"210","article-title":"Belief maintenance: an integrated approach to uncertainty management","author":"Laskey","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB33","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/TR.1980.5220885","article-title":"Recursive disjoint products, inclusion-exclusion, and min-cut approximations","volume":"R-29","author":"Locks","year":"1980","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB34","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TR.1987.5222436","article-title":"A minimizing algorithm for sum of disjoint products","volume":"R-36","author":"Locks","year":"1987","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB35","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic Logic","volume":"28","author":"Nilsson","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB36","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(90)90103-7","article-title":"Dempster's rule of combination is #P-complete","volume":"44","author":"Orponen","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB37","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","article-title":"Fusion, propagation, and structuring in belief networks","volume":"29","author":"Pearl","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB38","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-051489-5.50015-1","article-title":"Non-Bayesian formalisms for managing uncertainty","author":"Pearl","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB39","series-title":"Probabilistic Reasoning in Intelligent Systems","author":"Pearl","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB40","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TPAMI.1985.4767656","article-title":"A computational approach to approximate and plausible reasoning with applications to expert systems","volume":"7","author":"Prade","year":"1985","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/0888-613X(90)90016-U_BIB41","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TR.1986.4335429","article-title":"Bounds on the reliability of networks","volume":"R-35","author":"Provan","year":"1986","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0888-613X(90)90016-U_BIB42","series-title":"Proceedings of the European Conference on Artificial Intelligence","first-page":"547","article-title":"Solving diagnostic problems using extended truth maintenance systems","author":"Provan","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB43","series-title":"Proceedings of the International Joint Conference on Artificial Intelligence","article-title":"An analysis of ATMS-based techniques for computing Dempster-Shafer Belief functions","author":"Provan","year":"1989"},{"key":"10.1016\/0888-613X(90)90016-U_BIB44","article-title":"An analysis of exact and approximation algorithms for Dempster-Shafer theory","author":"Provan","year":"1990"},{"key":"10.1016\/0888-613X(90)90016-U_BIB45","series-title":"Proc. ECAI","article-title":"The Computational complexity of Multiple-Context Truth Maintenance Systems","author":"Provan","year":"1990"},{"key":"10.1016\/0888-613X(90)90016-U_BIB46","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0888-613X(90)90016-U_BIB47","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1287\/opre.32.3.516","article-title":"Computing network reliability in time polynomial in the number of cuts","volume":"32","author":"Provan","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/0888-613X(90)90016-U_BIB48","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB49","series-title":"Proceedings of the American Association for Artificial Intelligence","first-page":"183","article-title":"Foundations of assumption-based truth maintenance systems: preliminary report","author":"Reiter","year":"1987"},{"key":"10.1016\/0888-613X(90)90016-U_BIB50","series-title":"Proceeding, International Joint Conference on Artificial Intelligence","first-page":"924","article-title":"Epistemic logics, probability, and the calculus of evidence","author":"Ruspini","year":"1987"},{"key":"10.1016\/0888-613X(90)90016-U_BIB51","series-title":"Foundations of Statistics","author":"Savage","year":"1954"},{"key":"10.1016\/0888-613X(90)90016-U_BIB52","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1287\/opre.34.6.871","article-title":"Evaluating influence diagrams","volume":"34","author":"Shachter","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/0888-613X(90)90016-U_BIB53","series-title":"A Mathematical Theory of Evidence","author":"Shafer","year":"1976"},{"key":"10.1016\/0888-613X(90)90016-U_BIB54","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0004-3702(87)90040-3","article-title":"Implementing Dempster's rule for hierarchical evidence","volume":"33","author":"Shafer","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0888-613X(90)90016-U_BIB55","article-title":"AUDITOR'S ASSISTANT: a knowledge engineering tool for audit decisions","author":"Shafer","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB56","series-title":"Proceeding, AAAI Workshop of Uncertainty in Artificial Intelligence","first-page":"307","article-title":"An axiomatic framework for Bayesian and belief function propagation","author":"Shenoy","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB57","series-title":"Proceeding, AAAI Workshop on Uncertainty in Artificial Intelligence","first-page":"160","article-title":"Propagation of belief functions: a distributed approach","author":"Shenoy","year":"1986"},{"key":"10.1016\/0888-613X(90)90016-U_BIB58","series-title":"Non-Standard Logics for Automated Reasoning","first-page":"253","article-title":"Belief functions","author":"Smets","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB59","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/34.55104","article-title":"The Combination of Evidence in the Transferable Belief Model","volume":"12","author":"Smets","year":"1990","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/0888-613X(90)90016-U_BIB60","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, acyclicity of hypergraphs, and selectively reduce hypergraphs","volume":"13","author":"Tarjan","year":"1974","journal-title":"Siam J. Comput."},{"key":"10.1016\/0888-613X(90)90016-U_BIB61","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","author":"Valiant","year":"1979","journal-title":"Siam J. Comput."},{"key":"10.1016\/0888-613X(90)90016-U_BIB62","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0020-7373(89)80032-X","article-title":"A Computationally Efficient Approximation of Dempster-Shafer Theory","volume":"30","author":"Vorbraak","year":"1989","journal-title":"Itnl. J. Man-Machine Studies"},{"key":"10.1016\/0888-613X(90)90016-U_BIB63","first-page":"81","article-title":"Review of Shafer's mathematical theory of evidence","volume":"5","author":"Zadeh","year":"1984","journal-title":"AI Mag."},{"key":"10.1016\/0888-613X(90)90016-U_BIB64","series-title":"Proceedings of the American Association for Artificial Intelligence","first-page":"205","article-title":"Evidential reasoning using DELIEF","author":"Zarley","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB65","article-title":"Studies on finding hypertree covers for hypergraphs","author":"Zhang","year":"1988"},{"key":"10.1016\/0888-613X(90)90016-U_BIB66","article-title":"Set-theoretical methods in the algebra of logic","volume":"8","author":"Zhuravlev","year":"1982","journal-title":"Probl. Kibern."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0888613X9090016U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0888613X9090016U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T10:24:34Z","timestamp":1552904674000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0888613X9090016U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":66,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0888613X9090016U"],"URL":"https:\/\/doi.org\/10.1016\/0888-613x(90)90016-u","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}