Bipolar Preference Problems: Framework, Properties and Solving Techniques

Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemingly specular notions, these two kinds of preferences should be dealt with differently to obtain the desired natural behaviour. We technically address this by generalizing the soft constraint formalism, which is able to model problems with one kind of preferences. We show that soft constraints model only negative preferences, and we define a new mathematical structure which allows to handle positive preferences as well. We also address the issue of the compensation between positive and negative preferences, studying the properties of this operation. Finally, we extend the notion of arc consistency to bipolar problems, and we show how branch and bound (with or without constraint propagation) can be easily adapted to solve such problems.

• Type: Conference
• Year: 2006
• Where: CSCLP
• Authors: Stefano Bistarelli, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable
• Keywords: Artificial Intelligence, Bipolar Preference Problems, CSCLP 2006, Negative Preferences, Soft Constraints