Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs (Q1815824): Difference between revisions
From MaRDI portal
Latest revision as of 15:45, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs |
scientific article |
Statements
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs (English)
0 references
19 November 1996
0 references
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.
0 references
probabilistic logic
0 references
probability bounds
0 references
probability inference
0 references
sets of logical formulas represented by digraphs
0 references