CP-nets and possibilistic logic: Two approaches to preference modeling Steps towards a comparison
Résumé
This paper proposes a first comparative study of the expressive power of two approaches to the repre-sentation of preferences: the CP-net and the possi-bilistic logic frameworks. It is shown that the sec-ond approach, using a method for handling sym-bolic priority weights, can always provide com-plete preorders compatible with the partial CP-net order. It is also pointed out that the counterpart of possibilistic logic in terms of conditional prefer-ence statements induce constraints which are gen-erally weaker than the ones generated by the ce-teris paribus principle. However, it enables the ex-pression of default preferences. TCP-nets and their possibilistic counterpart are also briefly discussed. Lastly, the extension of the possibilistic approach to non-binary preferences is outlined.