| Article ID: | iaor19971526 |
| Country: | Netherlands |
| Volume: | 65 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 20 |
| Publication Date: | Aug 1996 |
| Journal: | Annals of Operations Research |
| Authors: | Hooker J.N., Andersen K.A. |
| Keywords: | logic |
In this paper the authors consider the problem of determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. They establish a sharp upper bound, as well as a lower bound that is not in general sharp. The authors show further that under a certain condition the lower bound is sharp. In that case, they obtain a closed form solution for the possible probabilities of the atomic propositions.