{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T00:43:23Z","timestamp":1771721003112,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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,9]]},"DOI":"10.1007\/bf01531078","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:09:06Z","timestamp":1113869346000},"page":"189-205","source":"Crossref","is-referenced-by-count":42,"title":["A linear programming approach to reasoning about probabilities"],"prefix":"10.1007","volume":"1","author":[{"given":"Dimitris","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1990,9,1]]},"reference":[{"key":"BF01531078_CR1","unstructured":"T. Brun, J. Desrosiers, P. Hansen and H. Jaumard,Proc. Symp. on Mathematical Progress, Tokyo (1988)."},{"key":"BF01531078_CR2","doi-asserted-by":"crossref","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, 1963).","DOI":"10.1515\/9781400884179"},{"key":"BF01531078_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe, Decomposition principle for linear programming, Oper. Res. 8 (1960) 101\u2013111.","journal-title":"Oper. Res."},{"key":"BF01531078_CR4","unstructured":"R. Duda and R. Reboh, AI and decision making: The PROSPECTOR experience, in:AI Applications in Business, ed. W. Reitman (1984) pp. 111\u2013147."},{"key":"BF01531078_CR5","unstructured":"R. Fagin, J. Halpern and N. Megiddo,Proc. IEEE Conf. on Logics in Computer Science (1988)."},{"key":"BF01531078_CR6","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, 1979)."},{"key":"BF01531078_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson and L.J. Stockmeyer, Some simplified NP-complete problems, Theor. Comp. Sci. 1 (1976) 237\u2013267.","journal-title":"Theor. Comp. Sci."},{"key":"BF01531078_CR8","unstructured":"M. Genesareth and N. Nilsson,Logical Foundations for AI (Morgan Kaufmann, 1987)."},{"key":"BF01531078_CR9","doi-asserted-by":"crossref","unstructured":"G. Georgakopoulos, D. Kavvadias, and C.H. Papadimitriou, Probabilistic satisfiability, J. Complexity (1988).","DOI":"10.1016\/0885-064X(88)90006-4"},{"key":"BF01531078_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01593804","volume":"12","author":"D. Goldfarb","year":"1977","unstructured":"D. Goldfarb and J.K. Reid, A practicable steepest-edge Simplex algorithm, Math. Progr. 12 (1977) 361\u2013371.","journal-title":"Math. Progr."},{"key":"BF01531078_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P.L. Hammer","year":"1984","unstructured":"P.L. Hammer, P. Hansen and B. Simeone, Roof duality, complementation, and persistency in quadratic 0-1 optimization, Math. Prog. 28 (1984) 121\u2013155.","journal-title":"Math. Prog."},{"key":"BF01531078_CR12","unstructured":"D. Kavvadias, Complexity and heuristic methods for probabilistic logic, Ph.D. Dissertation, University of Patras (November 1988) (in Greek)."},{"key":"BF01531078_CR13","first-page":"291","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, BSTJ 49 (1970) 291\u2013307.","journal-title":"BSTJ"},{"key":"BF01531078_CR14","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B.W. Kernighan, An effective heuristic for the traveling salesman problem, Oper. Res. 21 (1973) 498\u2013516.","journal-title":"Oper. Res."},{"key":"BF01531078_CR15","doi-asserted-by":"crossref","unstructured":"N. Nilsson, Probabilistic logic, Artificial Intelligence (1986).","DOI":"10.1016\/0004-3702(86)90031-7"},{"key":"BF01531078_CR16","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, 1983)."},{"key":"BF01531078_CR17","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.18.6.992","volume":"18","author":"B. Rothfarb","year":"1970","unstructured":"B. Rothfarb, H. Frank, D.M. Rosenbaum, K. Steiglitz and D.J. Kleitman, Optimal design of offshore natural-gas pipeline systems, Oper. Res. 18 (1970) 992\u20131020.","journal-title":"Oper. Res."},{"key":"BF01531078_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214696","volume-title":"A Mathematical Theory of Evidence","author":"G. Shafer","year":"1976","unstructured":"G. Shafer,A Mathematical Theory of Evidence (Princeton, Univ. Press, 1976)."},{"key":"BF01531078_CR19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0025-5564(75)90047-4","volume":"3","author":"H.E. Shortliffe","year":"1975","unstructured":"H.E. Shortliffe and B.G. Buneman, A model of inexact reasoning in medicine, Math. Biosci. 3 (1975) 351\u2013379.","journal-title":"Math. Biosci."},{"key":"BF01531078_CR20","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L.A. Zadeh","year":"1971","unstructured":"L.A. Zadeh, Fuzzy sets, Information and Control 8 (1971) 338\u2013353.","journal-title":"Information and Control"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531078\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531078.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531078\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T04:17:19Z","timestamp":1625804239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01531078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":20,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01531078"],"URL":"https:\/\/doi.org\/10.1007\/bf01531078","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}