Expressive power and succinctness of propositional languages for preference representation

Several logical languages have been studied in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze how succinctly a preference relation can be expressed in those languages: after identifying the sets of preference relations expressed by several preference languages, we study their relative succinctness by giving some polynomial-size translations in some cases, and proving the impossibility of such translations in other cases