Determining Lower and Upper Bounds on Probabilities of Atomic Propositions in Sets of Logical Formulas Represented by Digraphs K. A. Andersen John N. Hooker 10.1184/R1/6705122.v1 https://kilthub.cmu.edu/articles/journal_contribution/Determining_Lower_and_Upper_Bounds_on_Probabilities_of_Atomic_Propositions_in_Sets_of_Logical_Formulas_Represented_by_Digraphs/6705122 In this paper we consider the problem of determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. We establish a sharp upper bound, as well as a lower bound that is not in general sharp. We show further that under a certain condition the lower bound is sharp. In that case, we obtain a closed form solution for the possible probabilities of the atomic propositions. 1996-01-01 00:00:00 Business Management