From preference logics to preference languages, and back

Bienvenu, Meghyn; Lang, Jerome; Wilson, Nic

From preference logics to preference languages, and back

Files

BienvenuLWKR2010.pdf(198.54 KB)

Accepted version

Date

2010

Authors

Bienvenu, Meghyn

Lang, Jerome

Wilson, Nic

Publisher

Association for the Advancement of Artificial Intelligence (AAAI

Abstract

Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research have had little interaction. This paper contributes to the bridging of these areas. We start by constructing a "prototypical" preference logic, which combines features of existing preference logics, and then we show that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it. After establishing useful characterizations of dominance and consistency in our logic, we study the complexity of satisfiability in the general case as well as for meaningful fragments, and we study the expressive power as well as the relative succinctness of some of these fragments.

Keywords

Preference logic , AI , Artificial intelligence , CP-nets , Preference languages

Citation

Bienvenu, M., Lang, J. and Wilson, N. (2010) 'From preference logics to preference languages, and back', Proceedings of the Twelfth International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), Toronto, Canada, 9 -13 May, pp. 414-424.