Logical Conditional Preference Theories

Abstract

CP-nets represent the dominant existing framework for expressing qualitative conditional preferences between alternatives, and are used in a variety of areas including constraint solving. Over the last fifteen years, a significant literature has developed exploring semantics, algorithms, implementation and use of CP-nets. This paper introduces a comprehensive new framework for conditional preferences: logical conditional preference theories (LCP theories). To express preferences, the user specifies arbitrary (constraint) Datalog programs over a binary ordering relation on outcomes. We show how LCP theories unify and generalize existing conditional preference proposals, and leverage the rich semantic, algorithmic and implementation frameworks of Datalog.

arXiv comment15 pages, 1 figure, submitted to CP 2015

References in corpus (4)

• CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
• The Computational Complexity of Dominance and Consistency in CP-Nets
• Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
• Probabilistic Conditional Preference Networks