Skip to main content

Using CBR to Select Solution Strategies in Constraint Programming

  • Conference paper
Case-Based Reasoning Research and Development (ICCBR 2005)

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

Included in the following conference series:

Abstract

Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes resources and may result in a problem going unsolved. We show how Case-Based Reasoning can be used to select good strategies. We design experiments which demonstrate that, on two problems with quite different characteristics, CBR can outperform four other strategy selection techniques.

This material is based upon work supported by Science Foundation Ireland under Grant No. 00/PI.1/C075.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beacham, A., Chen, X., Sillito, J., Van Beek, P.: Constraint Programming Lessons Learned from Crossword Puzzles. In: Procs. of 14th Canadian Conference on Artificial Intelligence, pp. 78–87 (2001)

    Google Scholar 

  2. Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: Disjoint, Partition and Intersection Constraints for Set and Multiset Variables. In: The Principles and Practice of Constraint Programming, Procs. of CP 2004, pp. 138–152 (2004)

    Google Scholar 

  3. Borret, J.E., Tsang, E.P.K.: A Context for Constraint Satisfaction Problem Formulation Selection. Constraints 6(4), 299–327 (2001)

    Article  MathSciNet  Google Scholar 

  4. Carchrae, T., Beck, J.C.: Low-Knowledge Algorithm Control. In: Procs. of the 19th AAAI, pp. 49–54 (2004)

    Google Scholar 

  5. Gebruers, C., Guerri, A., Hnich, B., Milano, M.: Making Choices using Structure at the Instance Level within a Case Based Reasoning Framework. In: Integration of AI and OR Technologies in Constraint Programming for Combinatorial Optimization Problems, pp. 380–386. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Gent, I., Walsh, T., Selman, B.: CSPLib: A Problem Library for Constraints, http://4c.ucc.ie/~tw/csplib/ (last accessed 02/02/2005)

  7. Gomes, P.: A Case-Based Approach to Software Design, PhD Dissertation, Universidade de Coimbra, Portugal (2003)

    Google Scholar 

  8. Grabert, M., Bridge, D.: Case-Based Reuse of Software Examplets. Journal of Universal Computer Science 9(7), 627–640 (2003)

    Google Scholar 

  9. Guo, H.: Algorithm Selection for Sorting and Probabilistic Inference: A Machine Learning-Based Approach. PhD Dissertation, Dept. of Computing and information Sciences, Kansas State University (2003)

    Google Scholar 

  10. ILOG Solver, http://www.ilog.com/products/solver/ (last accessed 02/02/2005)

  11. Kohavi, R., John, G.: Wrappers for Feature Subset Selection. Artificial Intelligence 97(1–2), 273–324 (1997)

    Article  MATH  Google Scholar 

  12. Little, J., Gebruers, C., Bridge, D., Freuder, E.: Capturing Constraint Programming Experience: A Case-Based Approach. In: International Workshop on Reformulating Constraint Satisfaction Problems, Workshop Programme of the 8th International Conference on Principles and Practice of Constraint Programming (2002)

    Google Scholar 

  13. Minton, S.: Automatically Configuring Constraint Satisfaction Programs: A Case Study. Constraints 1(1), 7–43 (1996)

    Article  MathSciNet  Google Scholar 

  14. Nadel, B.: Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens. IEEE Expert 5(3), 16–23 (1990)

    Article  MathSciNet  Google Scholar 

  15. Novello, S.: An ECLiPSe Program for the Social Golfer Problem, http://www.icparc.ic.ac.uk/eclipse/examples/golf.ecl.txt (last accessed 02/02/2005)

  16. Pang, R., Yang, Q., Li, L.: Case Retrieval using Nonlinear Feature-Space Transformation. In: Procs. of the 7th European Conference on Case-Based Reasoning, pp. 361–374 (2004)

    Google Scholar 

  17. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  18. Smith, B.: Reducing Symmetry in a Combinatorial Design Problem. Technical Report 2001.01, University of Leeds School of Computing Research Report Series (2001)

    Google Scholar 

  19. Sqalli, M., Purvis, L., Freuder, E.: Survey of Applications Integrating Constraint Satisfaction and Case-Based Reasoning. In: Procs. of the 1st International Conference and Exhibition on The Practical Application of Constraint Technologies and Logic Programming (1999)

    Google Scholar 

  20. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)

    Google Scholar 

  21. Wallace, M.G.: Practical Applications of Constraint Programming. Constraints 1(1–2), 139–168 (1996)

    Article  MathSciNet  Google Scholar 

  22. Wilson, D.C., Leake, D.B., Bramley, R.: Case-Based Recommender Components for Scientific Problem-Solving Environments. In: Procs. of the 16th International Association for Mathematics and Computers in Simulation World Congress, CD-ROM, Session 105, Paper 2 (2000)

    Google Scholar 

  23. Wilson, R., Martinez, T.: Improved Heterogeneous Distance Functions. Journal of Artificial Intelligence Research 6, 1–34 (1997)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gebruers, C., Hnich, B., Bridge, D., Freuder, E. (2005). Using CBR to Select Solution Strategies in Constraint Programming. In: Muñoz-Ávila, H., Ricci, F. (eds) Case-Based Reasoning Research and Development. ICCBR 2005. Lecture Notes in Computer Science(), vol 3620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11536406_19

Download citation

  • DOI: https://doi.org/10.1007/11536406_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28174-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics