Graphical readings of possibilistic logic bases

Salem Benferhat (1) , Didier Dubois (1) , Souhila Kaci (1) , Henri Prade (1)

1 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage

Possibility theory offers either a qualitive, 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 the product operator. Benferhat et al. (1999) 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 representations of possibilistic bases, which provides an easy structural reading of possibilistic bases. Moreover, this paper also provides another reading of possibilistic bases in terms of comparative preferences of the form "in the context p, q is preferred to not q". This enables us to explicit preferences underlying a set of goals with different levels of priority.

Domains: Computer Science [cs]; Artificial Intelligence [cs.AI]

Salem Benferhat, Didier Dubois, Souhila Kaci, Henri Prade. Graphical readings of possibilistic logic bases. 17th Conference Uncertainty in Artificial Intelligence (UAI 2001), Association for Uncertainty in Artificial Intelligence, Aug 2001, Seattle, United States. pp.24-31. ⟨hal-03299815⟩