Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs

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)

zbMATH Keywords

probability boundsprobabilistic logicprobability inferencesets of logical formulas represented by digraphs

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Probability and inductive logic (03B48)

Related Items

Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation ⋮ On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees

Cites Work

• 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
• Unnamed Item
• Unnamed Item