Skip to main content

Preference-Based Problem Solving for Constraint Programming

  • Conference paper
Recent Advances in Constraints (CSCLP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5129))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Preference-based constrained optimization with CP-nets. Computational Intelligence 20, 137–157 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Doyle, J.: Prospects for preferences. Computational Intelligence 20, 11–136 (2004)

    Article  MathSciNet  Google Scholar 

  3. Ehrgott, M.: A characterization of lexicographic max-ordering solutions. In: Methods of Multicriteria Decision Theory: Proceedings of the 6th Workshop of the DGOR Working-Group Multicriteria Optimization and Decision Theory, Egelsbach, pp. 193–202. Häsel-Hohenhausen (1997)

    Google Scholar 

  4. Gavanelli, M.: An algorithm for multi-criteria optimization in CSPs. In: ECAI 2002, pp. 136–140 (2002)

    Google Scholar 

  5. Junker, U.: Preference-based search and multi-criteria optimization. Annals of Operations Research 130, 75–115 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Junker, U.: QuickXplain: Preferred explanations and relaxations for over-constrained problems. In: AAAI 2004, pp. 167–172 (2004)

    Google Scholar 

  7. Junker, U.: Outer branching: How to optimize under partial orders? In: ECAI 2006 Workshop on Advances in Preference Handling, pp. 58–64 (2006)

    Google Scholar 

  8. Junker, U., Mailharro, D.: Preference programming: Advanced problem solving for configuration. AI-EDAM 17(1) (2003)

    Google Scholar 

  9. Keeney, R.L., Raiffa, H.: Decisions with Multiple Objectives. Wiley, Chichester (1976)

    MATH  Google Scholar 

  10. Kießling, W.: Foundations of preferences in database systems. In: 28th International Conference on Very Large Data Bases (VLDB 2002), pp. 311–322 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Junker, U. (2008). Preference-Based Problem Solving for Constraint Programming. In: Fages, F., Rossi, F., Soliman, S. (eds) Recent Advances in Constraints. CSCLP 2007. Lecture Notes in Computer Science(), vol 5129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89812-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89812-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89811-5

  • Online ISBN: 978-3-540-89812-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics