Introducing variable importance tradeoffs into CP-nets

  • Authors:
  • Ronen I. Brafman;Carmel Domshlak

  • Affiliations:
  • Computer Science Dept., Ben-Gurion University, Beer-Sheva, Israel;Computer Science Dept., Ben-Gurion University, Beer-Sheva, Israel

  • Venue:
  • UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The ability to make decisions and to assess potential courses of action is a comer-stone of many AI applications, and usually this requires explicit information about the decision-maker's preferences. In many applications, preference elicitation is a serious bottleneck. The user either does not have the time, the knowledge, or the expert support required to specify complex multi-attribute utility functions. In such cases, a method that is based on intuitive, yet expressive, preference statements is required. In this paper we suggest the use of TCP-nets, an enhancement of CP-nets, as a tool for representing, and reasoning about qualitative preference statements. We present and motivate this framework, define its semantics, and show how it can be used to perform constrained optimization.