Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. As a consequence of their coarse level of representation detail, qualitative probabilistic networks do not provide for resolving trade-offs and typically yield ambiguous results upon inference. We present an algorithm for computing more informative results for unresolved trade-offs. The algorithm builds upon the idea of zooming in on the truly ambiguous part of a qualitative probabilistic network and identifying the information that would serve to resolve the trade-offs present.
Silja Renooij, Linda C. van der Gaag, Shaw Green,