Some issues on the coherence of Min-based possibilistic causal networks

This paper focuses on Min-based possibilistic graphs which are natural counterparts of probabilistic causal networks. In particular, we discuss the coherence problem which concerns the nonrecovering of initial data provided by the expert. We show that the coherence problem should not be seen as a drawback, and has no influence neither on independence relations nor on propagation algorithms