Possibilistic Conditional Preference Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Possibilistic Conditional Preference Networks


The paper discusses the use of product-based possibilistic networks for representing conditional preference statements on discrete variables. The approach uses non-instantiated possibility weights to define conditional preference tables. Moreover, additional information about the relative strengths of symbolic weights can be taken into account. It yields a partial preference order among possible choices corresponding to a symmetric form of Pareto ordering. In the case of Boolean variables, this partial ordering coincides with the inclusion between the sets of preference statements that are violated. Furthermore, this graphical model has two logical counterparts in terms of possibilistic logic and penalty logic. The flexibility and the representational power of the approach are stressed. Besides, algorithms for handling optimization and dominance queries are provided.
Fichier principal
Vignette du fichier
benamor_15498.pdf (274.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01303854 , version 1 (18-04-2016)


  • HAL Id : hal-01303854 , version 1
  • OATAO : 15498


Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade. Possibilistic Conditional Preference Networks. 13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2015), Jul 2015, Compiègne, France. pp. 36-46. ⟨hal-01303854⟩
192 View
194 Download


Gmail Facebook X LinkedIn More