CP-nets and possibilistic logic: Two approaches to preference modeling. Steps towards a comparison

International audienceThis paper proposes a first comparative study of the expressive power of two approaches to the representation of preferences: the CP-net and the possibilistic logic frameworks. It is shown that the second approach, using a method for handling symbolic priority weights, can always provide complete preorders compatible with the partial CP-net order. It is also pointed out that the counterpart of possibilistic logic in terms of conditional preference statements induce constraints which are generally weaker than the ones generated by the ceteris paribus principle. However, it enables the expression 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