Boole's conditions of possible experience and reasoning under uncertainty

DOI10.1016/0166-218X(94)00050-NzbMath0835.90043MaRDI QIDQ1894361

Brigitte Jaumard, Pierre Hansen, Marcus V. Poggi de Aragão

Publication date: 15 April 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

redundancy; probabilistic satisfiability; set of logical sentences; vertex and ray enumeration

Mathematics Subject Classification ID

90C05: Linear programming

Related Items

An anytime deduction algorithm for the probabilistic logic and entailment problems, Probabilistic satisfiability with imprecise probabilities, Direct algorithms for checking consistency and making inferences from conditional probability assessments, Best second order bounds for two-terminal network reliability with dependent edge failures, Merging the local and global approaches to probabilistic satisfiability

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
• Probabilistic satisfiability
• A linear programming approach to reasoning about probabilities
• Polynomial algorithms for estimating network reliability
• Column Generation Methods for Probabilistic Logic
• Best Linear Bonferroni Bounds
• Best Possible Inequalities for the Probability of a Logical Function of Events