• Aucun résultat trouvé

Preference Modeling with Possibilistic Networks and Symbolic Weights: A Theoretical Study

N/A
N/A
Protected

Academic year: 2021

Partager "Preference Modeling with Possibilistic Networks and Symbolic Weights: A Theoretical Study"

Copied!
10
0
0

Texte intégral

Loading

Figure

Figure 1 : A preference network and its corresponding preference specification π(j b ) π(j r ) 1 α π(p b ) π(p w ) 1 β π(.|.) j b p b j b p w j r p b j r p wsb1θ1λ11srδ1θ211s w δ 2 1 λ 2 1
Figure 2 : Refinements between orderings in numerical setting (a), symbolic setting without constraints (b), or with constraints (c)
Figure 3 : Possibilistic product-based order relative to Example 1 Now, if we use the min-based chain rule, we will not be able to compare many configurations as long as no other constraint is added
Figure 5 : A π-Pref net (1) and a CP-net (2) modeling of the same preference specification

Références

Documents relatifs