Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs (Q1815824): Difference between revisions

The authors offer results on the problem of determining upper and lower bounds on the probabilities of atomic propositions (corresponding to nodes) in sets of logical formulas represented by digraphs. They obtain sharp upper bounds, and lower bounds that are not sharp except under a condition. In that special case they obtain sharp lower bounds as well, and thus a closed form solution for the possible probabilities of the atomic propositions.