Combinatorial problems such as scheduling, resource allocation, and configuration may involve many attributes that can be subject of user preferences. Traditional optimization approaches compile those preferences into a single utility function and use it as the optimization objective when solving the problem, but neither explain why the resulting solution satisfies the original preferences, nor indicate the trade-offs made during problem solving. We argue that the whole problem solving process becomes more transparent and controllable for the user if it is based on the original preferences. We will use the original preferences to control this process and to produce explanations of optimality of the resulting solution. Based on this explanation, the user can refine the preference model, thus gaining full control over the problem solver. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Junker, U. (2008). Preference-based problem solving for constraint programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5129 LNAI, pp. 109–126). Springer Verlag. https://doi.org/10.1007/978-3-540-89812-2_8
Mendeley helps you to discover research relevant for your work.