Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2001: Principles and Practice of Constraint Programming — CP 2001 pp 46–60Cite as

Collaborative Learning for Constraint Solving

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2239))

Abstract

Although constraint programming offers a wealth of strong, general-purpose methods, in practice a complex, real application demands a person who selects, combines, and refines various available techniques for constraint satisfaction and optimization. Although such tuning produces efficient code, the scarcity of human experts slows commercialization. The necessary expertise is of two forms: constraint programming expertise and problem-domain expertise. The former is in short supply, and even experts can be reduced to trial and error prototyping; the latter is difficult to extract. The project described here seeks to automate both the application of constraint programming expertise and the extraction of domain-specific expertise. It applies FORR, an architecture for learning and problem-solving, to constraint solving. FORR develops expertise from multiple heuristics. A successful case study is presented on coloring problems.

This work was performed while this author was at the University of New Hampshire.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borrett, J., Tsang, E. P. K., Walsh, N. R. Adaptive constraint satisfaction: the quickest first principle. In Proceedings of the 12th European Conference on AI. Budapest, Hungary. (1996) 160–164

    Google Scholar 

  2. Caseau, Y., Laburthe, F., Silverstein, G.: A Meta-Heuristic Factory for Vehicle Routing Problems. Principles and Practice of Constraint Programming-CP’99. Springer, Berlin (1999)

    Google Scholar 

  3. Minton, S., Automatically Configuring Constraint Satisfaction Programs: A Case Study. Constraints. 1 (1996)

    Google Scholar 

  4. Smith, D. R.: KIDS: A Knowledge-based Software Development System. In: M. R. Lowry and R. D. McCartney (eds.): Automating Software Design. AAAI Press (1991)

    Google Scholar 

  5. Saraswat, V. J., Van Hentenryck, P., Constraint Programming. ACM Computing Surveys, Special Issue on Strategic Directions in Computing Research. 28 (1996)

    Google Scholar 

  6. Freuder, E., Wallace, M., eds.): Special Issue on Constraints. IEEE Intelligent Systems, ed. Series, 15:1 (2000)

    Google Scholar 

  7. Freuder, E., Mackworth, A., eds.): Constraint-Based Reasoning. ed. Series. MIT Press, Cambridge, MA (1992)

    Google Scholar 

  8. Tsang, E. P. K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)

    Google Scholar 

  9. Chatterjee, S., Chatterjee, S., On Combining Expert Opinions. American journal of Mathematical and Management Sciences. 7 (1987) 271–295

    Article  Google Scholar 

  10. Jacobs, R. A., Methods for Combining Experts’ Probability Assessments. Neural Computation. 7 (1995) 867–888

    Article  Google Scholar 

  11. Biswas, G., Goldman, S., Fisher, D., Bhuva, B., Glewwe, G.: Assessing Design Activity in Complex CMOS Circuit Design. In: P. Nichols, S. Chipman, and R. Brennan (eds.): Cognitively Diagnostic Assessment. Lawrence Erlbaum, Hillsdale, NJ (1995)

    Google Scholar 

  12. Crowley, K., Siegler, R. S., Flexible Strategy Use in Young Children’s Tic-Tac-Toe. Cognitive Science. 17 (1993) 531–561

    Article  Google Scholar 

  13. Ratterman, M. J., Epstein, S. L. Skilled like a Person: A Comparison of Human and Computer Game Playing. In Proceedings of the Seventeenth Annual Conference of the Cognitive Science Society. Pittsburgh: Lawrence Erlbaum Associates. (1995) 709–714

    Google Scholar 

  14. Epstein, S. L. On Heuristic Reasoning, Reactivity, and Search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Montreal: Morgan Kaufmann. (1995) 454–461

    Google Scholar 

  15. Epstein, S. L., Prior Knowledge Strengthens Learning to Control Search in Weak Theory Domains. International Journal of Intelligent Systems. 7 (1992) 547–586

    Article  Google Scholar 

  16. Kiziltan, Z., Flener, P., Hnich, B. Towards Inferring Labelling Heuristics for CSP Application Domains. In Proceedings of the KI’01: Springer-Verlag. (2001)

    Google Scholar 

  17. Sadeh, N., Fox, M. S., Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence. 86 (1996) 1–41

    Article  Google Scholar 

  18. Nadel, B., Consistent labeling problems and their algorithms: expected complexities and theory-based heuristics. Artificial Intelligence. 21 (1983) 135–178

    Article  Google Scholar 

  19. Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Proceedings of the CP-96. (1996) 179–193

    Google Scholar 

  20. Simon, H. A.: The Sciences of the Artificial. second edn. MIT Press, Cambridge, MA (1981)

    Google Scholar 

  21. Keim, G. A., Shazeer, N. M., Littman, M. L., Agarwal, S., Cheves, C. M., Fitzgerald, J., Grosland, J., Jiang, F., Pollard, S., Weinmeister, K. PROVERB: The Probabilistic Cruciverbalist. In Proceedings of the Sixteenth National Conference on Artificial Intelligence. Orlando: AAAI Press. (1999) 710–717

    Google Scholar 

  22. Smith, B. M.: The Brélaz Heuristic and Optimal Static Orderings. Principles and Practice of Constraint Programming-CP’99,. Springer, Berlin (1999) 405–418

    Chapter  Google Scholar 

  23. Bessiere, C., Regin, J.-C.: MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: E. C. Freuder (ed. Principles and Practice of Constraint Programming-CP96, LNCS 1118. Springer-Verlag (1996) 61–75

    Chapter  Google Scholar 

  24. Freuder, E. C., A sufficient condition for backtrack-free search. Journal of the ACM. 29 (1982) 24–32

    Article  MathSciNet  Google Scholar 

  25. Epstein, S. L., Perceptually-Supported Learning. (Submitted for publication)

    Google Scholar 

  26. Epstein, S. L., Gelfand, J., Lock, E. T., Learning Game-Specific Spatially-Oriented Heuristics. Constraints. 3 (1998) 239–253

    Article  MathSciNet  Google Scholar 

  27. Littlestone, N., Warmuth, M. K., The Weighted Majority Algorithm. Information and Computation. 108 (1994) 212–261

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Hunter College and The Graduate School of The City, University of New York, 10021, New York, NY, USA

    Susan L. Epstein

  2. Cork Constraint Computation Centre, University College Cork, Cork, Ireland

    Eugene C. Freuder

Authors
  1. Susan L. Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eugene C. Freuder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, S.L., Freuder, E.C. (2001). Collaborative Learning for Constraint Solving. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

  • Online ISBN: 978-3-540-45578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation