Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. Both probability intervals and qualitative probabilities are considered. Analytical and numerical methods to test coherence and bound the probability of a conclusion are reviewed. They use polyhedral combinatorics and advanced methods of linear programming.
Keywords. Satisfiability, Probability intervals, Qualitative probabilities, Polyhedra, Linear programming, Column generation, Nonlinear 0--1 programming.
The paper is available in the following formats:
Marcus Poggi de Aragão
|Marcus Poggi de Aragãofirstname.lastname@example.org|