Graphical readings of possibilistic logic bases

  • Authors:
  • Salem Benferhat;Didier Dubois;Souhila Kaci;Henri Prade

  • Affiliations:
  • Institut de Recherche en Informatique de Toulouse, C.N.R.S., Université Paul Sabatier, Toulouse, France;Institut de Recherche en Informatique de Toulouse, C.N.R.S., Université Paul Sabatier, Toulouse, France;Institut de Recherche en Informatique de Toulouse, C.N.R.S., Université Paul Sabatier, Toulouse, France;Institut de Recherche en Informatique de Toulouse, C.N.R.S., Université Paul Sabatier, Toulouse, France

  • Venue:
  • UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Possibility theory offers either a qualitative, or a numerical framework for representing uncertainty, in terms of dual measures of possibility and necessity. This leads to the existence of two kinds of possibilistic causal graphs where the conditioning is either based on the minimum, or on the product operator. Benferhat et al. [3] have investigated the connections between min-based graphs and possibilistic logic bases (made of classical formulas weighted in terms of certainty). This paper deals with a more difficult issue: the product-based graphical representation of possibilistic bases, which provides an easy structural reading of possibilistic bases.