Treatment of imprecise probabilities within the probabilistic satisfiabilit
y approach to uncertainty in knowledge-based systems is surveyed and discus
sed. Both probability intervals and qualitative probabilities are considere
d. Analytical and numerical methods to test coherence and bound the probabi
lity of a conclusion are reviewed, They use polyhedral combinatorics and ad
vanced methods of linear programming. (C) 2000 Published by Elsevier Scienc
e Inc. All rights reserved.