{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:28:43Z","timestamp":1759332523649},"reference-count":17,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Imagine a database\u2014a set of propositions $\\varGamma =\\{F_1,\\ldots ,F_n\\}$ with some kind of probability estimates and let a proposition $X$ logically follow from $\\varGamma $. What is the best justified lower bound of the probability of $X$? The traditional approach, e.g. within Adams\u2019 probability logic, computes the numeric lower bound for $X$ corresponding to the worst-case scenario. We suggest a more flexible parameterized approach by assuming probability events $u_1,u_2,\\ldots ,u_n$ that support $\\varGamma $ and calculating aggregated evidence$e(u_1,u_2,\\ldots ,u_n)$ for $X$. The probability of $e$ provides a tight lower bound for any, not only a worst-case, situation. The problem is formalized in a version of justification logic and the conclusions are supported by corresponding completeness theorems. This approach can handle conflicting and inconsistent data and allows the gathering both positive and negative evidence for the same proposition.<\/jats:p>","DOI":"10.1093\/logcom\/exaa003","type":"journal-article","created":{"date-parts":[[2020,1,26]],"date-time":"2020-01-26T20:06:46Z","timestamp":1580069206000},"page":"61-76","source":"Crossref","is-referenced-by-count":2,"title":["On aggregating probabilistic evidence"],"prefix":"10.1093","volume":"30","author":[{"given":"Sergei","family":"Artemov","sequence":"first","affiliation":[{"name":"The City University of New York, the Graduate Center, 365 Fifth Avenue, New York City, NY 10016, USA"}]}],"member":"286","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"key":"2020040702352065600_ref1","volume-title":"A Primer of Probability Logic","author":"Adams","year":"1998"},{"key":"2020040702352065600_ref2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF00485053","article-title":"On the uncertainties transmitted from premisses to conclusions in deductive inferences","volume":"30","author":"Adams","year":"1975","journal-title":"Synthese"},{"key":"2020040702352065600_ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2687821","article-title":"Explicit provability and constructive semantics","volume":"7","author":"Artemov","year":"2001","journal-title":"Bulletin of Symbolic Logic"},{"key":"2020040702352065600_ref4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1017\/S1755020308090060","article-title":"The logic of justification","volume":"1,","author":"Artemov","year":"2008","journal-title":"The Review of Symbolic Logic"},{"key":"2020040702352065600_ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-27683-0_3","article-title":"On aggregating probabilistic evidence","author":"Artemov","year":"2016"},{"key":"2020040702352065600_ref6","doi-asserted-by":"crossref","DOI":"10.1017\/9781108348034","article-title":"Justification Logic: Reasoning with Reasons","volume-title":"Cambridge Tracts in Mathematics","author":"Artemov","year":"2019"},{"key":"2020040702352065600_ref7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1017\/CBO9780511611308.010","article-title":"Aggregating probability distributions","volume-title":"Advances in Decision Analysis: From Foundations to Applications","author":"Clemen","year":"2007"},{"key":"2020040702352065600_ref8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"key":"2020040702352065600_ref9","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller","year":"1968"},{"key":"2020040702352065600_ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.apal.2004.04.009","article-title":"The logic of proofs, semantically","volume":"132,","author":"Fitting","year":"2005","journal-title":"Annals of Pure and Applied Logic"},{"key":"2020040702352065600_ref11","volume-title":"Reasoning About Uncertainty","author":"Halpern","year":"2003"},{"key":"2020040702352065600_ref12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-27683-0_13","article-title":"Probabilistic Justification Logic","author":"Kokkinis","year":"2016"},{"key":"2020040702352065600_ref13","first-page":"1950","article-title":"Grundbegriffe der Wahrscheinlichkeitrechnung, Ergebnisse Der Mathematik, Springer, Berlin","volume-title":"translated as Foundations of Probability","author":"Kolmogorov","year":"1933"},{"key":"2020040702352065600_ref14","volume-title":"Logics of Proofs and Justifications","author":"Kuznets","year":"2019"},{"key":"2020040702352065600_ref15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11229-011-0025-3","article-title":"The theory of judgment aggregation: an introductory review","volume":"187,","author":"List","year":"2012","journal-title":"Synthese"},{"key":"2020040702352065600_ref16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2539-1","article-title":"Probability","volume-title":"Volume 95 of Graduate Texts in Mathematics","author":"Shiryaev","year":"1996"},{"key":"2020040702352065600_ref17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0049-237X(08)71662-8","article-title":"Probabilistic inference and the concept of total evidence","volume-title":"Aspects of Inductive Logic","author":"Suppes","year":"1966."}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/1\/61\/33016401\/exaa003.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/1\/61\/33016401\/exaa003.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T06:35:33Z","timestamp":1586241333000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/30\/1\/61\/5739320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":17,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,2,17]]},"published-print":{"date-parts":[[2020,1,23]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exaa003","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,1]]},"published":{"date-parts":[[2020,1]]}}}