Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
From MaRDI portal
Publication:1815824
DOI10.1007/BF02187324zbMath0861.03014MaRDI QIDQ1815824
John N. Hooker, Kim Allan Andersen
Publication date: 19 November 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
probability bounds; probabilistic logic; probability inference; sets of logical formulas represented by digraphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic logic
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Geometric algorithms and combinatorial optimization
- Characterizing consistency in probabilistic logic for a class of Horn clauses