## Preference-based Constrained Optimization with CP-nets (2001)

### Cached

### Download Links

Venue: | Computational Intelligence |

Citations: | 55 - 11 self |

### BibTeX

@ARTICLE{Boutilier01preference-basedconstrained,

author = {Craig Boutilier and Ronen I. Brafman and Holger H. Hoos and David Poole},

title = {Preference-based Constrained Optimization with CP-nets},

journal = {Computational Intelligence},

year = {2001},

volume = {20},

pages = {137--157}

}

### Years of Citing Articles

### OpenURL

### Abstract

Many AI tasks, such as product configuration, decision support, and the construction of autonomous agents, involve a process of constrained optimization, that is, optimization of behavior or choices subject to given constraints. In this paper we present an approach for constrained optimization based on a set of hard constraints and a preference ordering represented using a CP-network - a graphical model for representing qualitative preference information. This approach offers both pragmatic and computational advantages. First, it provides a convenient and intuitive tool for specifying the problem, and in particular, the decision maker's preferences. Second, it provides an algorithm for finding the most preferred feasible outcomes that has the following anytime property: the set of preferred feasible outcomes are enumerated without backtracking. In particular, the first feasible solution generated by this algorithm is optimal.

### Citations

7052 |
Probabilistic Reasoning in Intelligent Systems
- Pearl
- 1988
(Show Context)
Citation Context ...re associated with subsets of variables, and the aggregation is done via summation|correspond to the notion of additively decomposable utility function (Bertele & Brioschi, 1972; Dechter, Dechter, & P=-=earl, 1988-=-; Shachter & Tatman, 1990; Jensen, Jensen, & Dittmer, 1994), while fuzzy CSPs are grounded in the framework of possibilistic logic (Dubois & Prade, 1986). Unfortunately, while being very expressive, t... |

1259 | Decisions with Multiple Objectives: Preferences and value tradeoffs - Keeney, Raiffa - 1976 |

944 | Temporal constraint networks - Dechter, Meiri, et al. - 1991 |

497 | An Analysis of Time-dependent Planning - Dean, Boddy - 1988 |

421 | Partial constraint satisfaction - Freuder, Wallace - 1962 |

351 | Possibility Theory: An Approach to Computerized Processing of Uncertainty - Dubois, Prade - 1988 |

288 | Context-specific independence in Bayesian networks - Boutilier, Friedman, et al. - 1996 |

224 | Poole D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements
- Boutilier, Brafman, et al.
(Show Context)
Citation Context .... In this paper we restrict the discussion to acyclic CP-nets. Likewise, for a formal specication of the semantics of CP-networks and other properties of this representation, we refer the reader to (B=-=outilier et al., 2002-=-). 2.3 The Induced Preference Relation Preferential information captured by an acyclic CP-net induces a partial order on the complete assignments to the variables of the network. This partial order ca... |

182 | SemiringBased Constraint Solving and Optimization - Bistarelli, Montanari, et al. - 1997 |

179 | Nonserial Dynamic Programming - BertelĂ¨, Brioschi - 1972 |

125 | Graphical models for preference and utility - Bacchus, Grove - 1995 |

115 | Reasoning with Conditional Ceteris Paribus Preference Statements
- Boutilier, Brafman, et al.
- 1999
(Show Context)
Citation Context ...iven Z. Note that these notions are purely qualitative variants of the corresponding standard notions in multi-attribute utility theory (Keeney & Raia, 1976). 2.2 CP-nets CP-nets were introduced in (B=-=outilier et al., 1999-=-) as a tool for compactly representing qualitative preference relations. This graphical model exploits conditional preferential independence in structuring a decision maker's preferences under a ceter... |

111 | Preferential semantics for goals
- Doyle, Wellman
- 1991
(Show Context)
Citation Context ...meal with a red wine to the meal with a white wine. As argued by many philosophers (see Hansson (1996, 2001) for an overview) and AI researchers (Doyle, 4 CP-Nets & Constrained Optimization Shoham, & =-=Wellman, 1991-=-; Doyle & Wellman, 1994), most of the preferences that we express or act upon seem to be of this type. In this paper we show that CP-nets are not only an intuitive tool for structuring one's preferenc... |

107 | A POMDP Formulation of Preference Elicitation Problems
- Boutilier
(Show Context)
Citation Context ...rk, bounds (Wang & Boutilier, 2003; Boutilier, Patrascu, Poupart, & Schuurmans, 2003), constraints (White, III, Sage, & Dozono, 1984; Blythe, 2002), or distributions (Chajewska, Koller, & Parr, 2000; =-=Boutilier, 2002-=-) are placed on the (numerical) parameters of the underlying utility function. These models still often require users to assess quantitative information (such as tradeoff weights), though in a less pr... |

99 | H.: Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4
- Bistarelli, Montanari, et al.
- 1999
(Show Context)
Citation Context ... to dierent extent by dierent variable assignments. There is muchsexibility in how such local preferences are specied, and how they are combined: Various soft-constraints models, such as weighted (Bis=-=tarelli et al., 1999-=-), fuzzy (Schiex, 1992), probabilistic (Fargier & Lang, 1993), and lexicographic (Fargier, Lang, & Schiex, 1993) CSPs, are discussed in the literature on constraint satisfaction. Note that some of the... |

99 | Making Rational Decisions Using Adaptive Utility Elicitation
- Chajewska, Koller, et al.
(Show Context)
Citation Context ...ied utility functions. In such work, bounds (Wang & Boutilier, 2003; Boutilier, Patrascu, Poupart, & Schuurmans, 2003), constraints (White, III, Sage, & Dozono, 1984; Blythe, 2002), or distributions (=-=Chajewska, Koller, & Parr, 2000-=-; Boutilier, 2002) are placed on the (numerical) parameters of the underlying utility function. These models still often require users to assess quantitative information (such as tradeoff weights), th... |

84 | Possibilistic constraints satisfaction problems or How to handle soft constraints
- Schiex
- 1992
(Show Context)
Citation Context ...ariable assignments. There is muchsexibility in how such local preferences are specied, and how they are combined: Various soft-constraints models, such as weighted (Bistarelli et al., 1999), fuzzy (S=-=chiex, 1992-=-), probabilistic (Fargier & Lang, 1993), and lexicographic (Fargier, Lang, & Schiex, 1993) CSPs, are discussed in the literature on constraint satisfaction. Note that some of these models have corresp... |

83 | Uncertainty in constraint satisfaction problems: a probabilistic approach - Fargier, Lang - 1993 |

65 | Representing Preferences as Ceteris Paribus Comparatives - Doyle, Wellman - 1994 |

48 |
Selecting preferred solutions in fuzzy constraint satisfaction problems
- Fargier, Lang, et al.
(Show Context)
Citation Context ...eloped to model constraint satisfaction problems that are either overconstrained, and thus \unsolvable" (Freuder & Wallace, 1992), or that suer from imprecise knowledge about the actual constrain=-=ts (Fargier & Lang, 1993-=-). In the soft constraints formalism, the constrained optimization problem is presented in the form of a set of preference orderings over assignments to subsets of variables, together with some operat... |

45 | CP-nets: Reasoning and consistency testing, in
- Domshlak, Brafman
- 2002
(Show Context)
Citation Context ...c CP-nets and the development of eective algorithms for testing their consistency is an area of ongoing research, and some initial results on these issues are presented in (Domshlak & Brafman, 2002; D=-=omshlak, 200-=-2). In this paper we restrict the discussion to acyclic CP-nets. Likewise, for a formal specication of the semantics of CP-networks and other properties of this representation, we refer the reader to ... |

40 | Preference Logic - Hansson |

36 | A logic of relative desire (preliminary report - Doyle, Shoham, et al. - 1991 |

33 | Reasoning about Soft Constraints and Conditional Preferences: Complexity Results and Approximation Techniques
- Domshlak, Rossi, et al.
- 2003
(Show Context)
Citation Context ... its expected practical usefulness) is very limited. Finally, we note that some recent work attempts to combine the capabilities of soft-constraints with the decoupled approach pursued in this paper (=-=Domshlak, Rossi, Venable, & Walsh, 2003-=-). 1.2 Overview The main contribution of this paper is a qualitative, decoupled specification method for constrained optimization problems by means of an intuitive qualitative preference specification... |

30 |
Visual exploration and incremental utility elicitation
- Blythe
(Show Context)
Citation Context ... is the use of imprecisely specified utility functions. In such work, bounds (Wang & Boutilier, 2003; Boutilier, Patrascu, Poupart, & Schuurmans, 2003), constraints (White, III, Sage, & Dozono, 1984; =-=Blythe, 2002-=-), or distributions (Chajewska, Koller, & Parr, 2000; Boutilier, 2002) are placed on the (numerical) parameters of the underlying utility function. These models still often require users to assess qua... |

19 | Constraint-based optimization with the minimax decision criterion
- Boutilier, Patrascu, et al.
- 2003
(Show Context)
Citation Context ...An alternative that lies somewhere between quantitative and qualitative preference representations is the use of imprecisely specified utility functions. In such work, bounds (Wang & Boutilier, 2003; =-=Boutilier, Patrascu, Poupart, & Schuurmans, 2003-=-), constraints (White, III, Sage, & Dozono, 1984; Blythe, 2002), or distributions (Chajewska, Koller, & Parr, 2000; Boutilier, 2002) are placed on the (numerical) parameters of the underlying utility ... |

16 |
Interactive goal programming
- Dyer
- 1972
(Show Context)
Citation Context ...rticular region of the search space can be obtained through user queries in an attempt to minimize computational eort. This observation is not novel (see work, e.g., on interactive goal programming (D=-=yer, 197-=-2)). There are clear tradeos involved between the number and complexity of the user queries required to prune part of the search space and the amount of search space expected to be pruned. Further stu... |

14 | What is ceteris paribus preference - Hansson - 1996 |

10 | Time-critical action: Representation and application - Horvitz, Seiver - 1997 |

10 | Frominfluence diagrams to junction trees - Jensen, Jensen, et al. - 1994 |

8 | Product conguration frameworks - A survey - Sabin, Weigel - 1998 |

7 | Modeling and Reasoning about Preferences with CP-nets
- Domshlak
- 2002
(Show Context)
Citation Context ...c CP-nets and the development of effective algorithms for testing their consistency is an area of ongoing research, and some initial results on these issues currently exist (Domshlak & Brafman, 2002; =-=Domshlak, 2002-=-). In this paper we restrict the discussion to acyclic CP-nets. Likewise, for a formal specification of the semantics of CP-networks and other properties of this representation, we refer the reader to... |

5 | Presentation adaptation for rich media messages. STRIMM Consortium Working Paper - Brafman, Friedman - 2003 |

4 | Dynamic programming and in diagrams - Tatman, Shachter - 1990 |

1 |
Sales con in business processes
- Haag
- 1998
(Show Context)
Citation Context ...sions on behalf of multiple users|the constraints are known by (i.e., encoded within) the system, while the preferences vary from user to user. Consider, for example, customized product conguration (H=-=aag, 1998-=-; Sabin & Weigel, 1998), embodied, say, as a web site that assembles components for some type of system. In this class of problems, we typically have two parties involved, the manufacturer and the con... |

1 |
Synchronized rich-media adaptation
- Brafman, Friedman
- 2003
(Show Context)
Citation Context ...r device by finding a feasible presentation of the message. On the other hand, the 1 This application is being developed by the STRIMM Consortium using the language and tools presented in this paper (=-=Brafman & Friedman, 2003-=-). 3smessage author, who does not know at composition time on what devices her message will be displayed, needs to provide information that will help the transcoder select the best feasible presentati... |

1 |
Optimization in constraint networks.InOliver,R.M.,&Smith,J.Q.(Eds.),Influence Diagrams, Belief Nets and Decision Analysis
- Dechter, Dechter, et al.
- 1988
(Show Context)
Citation Context ... associated with subsets of variables, and the aggregation is done via summationâ€”correspond to the notion of additively decomposable utility functions (Keeney & Raiffa, 1976; BertelĂ¨ &Brioschi, 1972; =-=Dechter, Dechter, & Pearl, 1988-=-; Jensen, Jensen, & Dittmer, 1994), while fuzzy CSPs are grounded in the framework of possibilistic logic (Dubois & Prade, 1988). Unfortunately, while being very expressive, these quantitative models ... |