A possibilistic logic handling of strong preferences

This paper presents a possibilistic logic encoding of strong preferences of the form "in the context p, q is always preferred to ~q". We first present a semantics algorithm which allows one to rank-order different possible solutions with respect to a set of strong preferences. Then we provide its syntactic counterpart, where we show that any set of strong preferences can be transformed into a possibilistic knowledge base. This provides practical and efficient machinery to deal with strong preferences