%0 Conference Proceedings
%T Graphical readings of possibilistic logic bases
%+ Argumentation, DÃ©cision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA)
%A Benferhat, Salem
%A Dubois, Didier
%A Kaci, Souhila
%A Prade, Henri
%< avec comitÃ© de lecture
%( UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence ; ISBN: 978-1-55860-800-9
%B 17th Conference Uncertainty in Artificial Intelligence (UAI 2001)
%C Seattle, United States
%I Morgan Kaufmann Publishers
%P 24-31
%8 2001-08-02
%D 2001
%Z 1301.2255
%Z Computer Science [cs]/Artificial Intelligence [cs.AI]Conference papers
%X 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.
%G English
%L hal-03299815
%U https://univ-artois.hal.science/hal-03299815
%~ UNIV-ARTOIS
%~ UNIV-TLSE2
%~ UNIV-TLSE3
%~ CNRS
%~ UT1-CAPITOLE
%~ IRIT
%~ IRIT-ADRIA
%~ IRIT-IA
%~ TOULOUSE-INP
%~ UNIV-UT3
%~ UT3-INP
%~ UT3-TOULOUSEINP