Skip to main content

The Adaptive Constraint Engine

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

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

Abstract

The Adaptive Constraint Engine (ACE) seeks to automate the application of constraint programming expertise and the extraction of domain-specific expertise. Under the aegis of FORR, an architecture for learning and problem-solving, ACE learns search-order heuristics from problem solving experience. This paper describes ACE’s approach, as well as new experimental results on specific problem classes. ACE is both a test-bed for CSP research and a discovery environment for new algorithms.

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. Epstein, S. L.: For the Right Reasons: The FORR Architecture for Learning in a Skill Domain. Cognitive Science 18 (1994) 479–511

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  4. 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 

  5. Epstein, S. L. and Freuder, G. Collaborative Learning for Constraint Solving. In: Walsh, T. (ed.): Principles and Practice of Constraint Programming-CP2001. Vol. 2239. Springer Verlag, Seattle WA (2001) 46–60

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  8. Epstein, S. L.: Pragmatic Navigation: Reactivity, Heuristics, and Search. Artificial Intelligence 100 (1998) 275–322

    Article  MATH  Google Scholar 

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

    Google Scholar 

  10. Frost and Dechter, R.: Look-ahead value ordering for constraint satisfaction problems. In Proceedings of IJCAI-95. Montreal (1995) 572–578

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  17. Laurière, J. L.: ALICE: A Language and a Program for Solving Combinatorial Problems. Artificial Intelligence 10 (1978) 29–127

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, S.L., Freuder, E.C., Wallace, R., Morozov, A., Samuels, B. (2002). The Adaptive Constraint Engine. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics