Learning to support constraint programmers

Computational Intelligence

Volumn 21, Issue 4, 2005, Pages 336-371

  Epstein, Susan L ^a   Freuder, Eugene C ^b   Wallace, Richard J ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Cognitively oriented architecture; Constraint satisfaction; Machine learning; Mixture of experts

Indexed keywords

COMPUTER ARCHITECTURE; CONSTRAINT THEORY; HEURISTIC METHODS; LEARNING SYSTEMS; PROBLEM SOLVING;

ADAPTIVE CONSTRAINT ENGINE (ACE); COGNITIVELY-ORIENTED ARCHITECTURE (FORR); CONSTRAINT SATISFACTION;

ADAPTIVE SYSTEMS;

EID: 33745196922     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2005.00277.x     Document Type: Article

References (48)

1. BECK, J. C., P. PROSSER, and E. SELENSKY. 2003. Vehicle routing and job shop scheduling: What's the difference? In Thirteenth International Conference on Automated Planning and Scheduling -ICAPS03, Trento, Italy.
2. BESSIÈRE, C., and J.-C. RÉGIN. 1996. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Principles and Practice of Constraint Programming - CP96, LNCS 1118. Edited by E. C. Freuder. Springer-Verlag, Berlin, pp. 61-75.
3. BISWAS, G., S. GOLDMAN, D. FISHER, B. BHUVA, and G. GLEWWE. 1995. Assessing design activity in complex CMOS circuit design. In Cognitively Diagnostic Assessment. Edited by P. Nichols, S. Chipman. and R. Brennan. Erlbaum, Hillsdale, NJ, pp. 167-188.
4. BORRETT, J., E. P. K. TSANG, and N. R. WALSH. 1996. Adaptive constraint satisfaction: The quickest first principle. In 12th European Conference on AI, Budapest, Hungary.
5. CARBONELL, J. G., C. A. KNOBLOCK, and S. N. MINTON. 1991. PRODIGY: An integrated architecture for planning and learning. In Architectures for Intelligence, Edited by K. VanLehn. Erlbaum, Hillsdale, NJ.
6. CHATTERJEE, S., and S. CHATTERJEE. 1987. On combining expert opinions. American Journal of Mathematical and Management Sciences, 7(3-4):271-295.
7. CHEESEMAN, P., B. KANEFSKY, and W. M. TAYLOR. 1991. Where the REALLY hard problems are. In Twelfth International Joint Conference on Artificial Intelligence, Sydney, Australia.
8. CROWLEY, K., and R. S. SIEGLER. 1993. Flexible strategy use in young children's tic-tac-toe. Cognitive Science, 17(4):531-561.
9. DECHTER, R. 2003. Constraint Processing. Morgan Kaufmann, San Francisco, CA.
10. EPSTEIN, S. L. 1995. On heuristic reasoning, reactivity, and search. In Fourteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Montreal.
11. EPSTEIN, S. L. 1998. Pragmatic navigation: Reactivity, heuristics, and search. Artificial Intelligence, 100(1-2):275-322.
12. EPSTEIN, S. L. 2001. Learning to play expertly: A tutorial on Hoyle. In Machines That Learn to Play Games. Edited by J. Fürnkranz and M. Kubat, Nova Science, Huntington, NY, pp. 153-178.
13. EPSTEIN, S. L. 2004. Metaknowledge for autonomous systems. AAAI Spring Symposium on Knowledge Representation and Ontology for Autonomous Systems, AAAI, Palo, Alto, CA.
14. EPSTEIN, S. L., E. C. FREUDER, R. WALLACE, A. MOROZOV, and B. SAMUELS. 2002. The adaptive constraint engine. In Principles and Practice of Constraint Programming - CP2002. Edited by P. Van Hentenryck, Springer Verlag, Berlin, LNCS 2470, pp. 525-540.
15. EPSTEIN, S. L., and G. FREUDER. 2001. Collaborative learning for constraint solving. In Principles and Practice of Constraint Programming - CP2001. Edited by T. Walsh. Springer Verlag, Berlin, 2239, pp. 46-60.
16. EPSTEIN, S. L., J. GELFAND, and E. T. LOCK. 1998. Learning game-specific spatially-oriented heuristics. Constraints, 3(2-3):239-253.
17. EPSTEIN, S. L., and T. LIGORIO. 2004. Fast and frugal reasoning enhances a solver for really hard problems. Cognitive Science 2004, Earlbaum, Chicago.
18. FREUDER, E. 1982. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24-32.
19. FREUDER, E., and A. MACKWORTH, Eds. 1992. Constraint-Based Reasoning. MIT Press, Cambridge, MA.
20. FROST, and R. DECHTER. 1995. Look-ahead value ordering for constraint satisfaction problems. In IJCAI-95, Montreal.
21. GASCHNIG, J. 1979. A problem similarity approach to devising heuristics: First results. In Sixth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Tokyo.
22. GEELEN, P. A. 1992. Dual viewpoint heuristics for binary constraint satisfaction problems. In 10th European Conference on Artificial Intelligence, Vienna, Austria.
23. GENT, I. E., E. MACINTYRE, P. PROSSER, and T. WALSH. 1996. The constrainedness of search. In Thirteenth National Conference on Artificial Intelligence, Portland, OR.
24. GIGERENZER, G., and G. GOLDSTEIN. 1996. Reasoning the fast and frugal way: Models of bounded rationality. Psychological Review, 103(4):650-669.
25. GIGERENZER, G., P. M. TODD, and A. R. GROUP. 1999. Simple Heuristics that Make Us Smart. Oxford University Press, New York.
26. GINSBERG, M. L. 1993. Dynamic backtracking. JAIR, 1:25-26.
27. GOMES, C. P., B. SELMAN, N. CRATO, and H. KAUTZ. 2000. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24:67-100.
28. JACOBS, R. A. 1995. Methods for combining experts' probability assessments. Neural Computation, 7: 867-888.
29. JOHNSON, D. B., C. R. ARAGON, L. A. MCGEOOH, and C. SCHEVON 1989. Optimization by simulated annealing: An experimental evaluation: Part 1, Graph partitioning. Operations Research, 37:865-892.
30. KEIM, G. A., N. M. SHAZEER, M. L. LITTMAN, S. AGARWAL, C. M. CHEVES, J. FITZGERALD, J. GROSLAND, F. JIANG, S. POLLARD, and K. WEINMEISTER. 1999. PROVERB: The probabilistic cruciverbalist. In Sixteenth National Conference on Artificial Intelligence. AAAI Press, Orlando.
31. KIZILTAN, Z., P. FLENER, and B. HNICH. 2001. Towards inferring labelling heuristics for CSP application domains. In KI'01. Springer-Verlag, Berlin.
32. KONDRAK, G., and P. VAN BEEK. 1995. A theoretical evaluation of selected backtracking algorithms. In Fourteenth International Joint Conference on Artificial Intelligence, Montreal, Canada.
33. LANGLEY, P. 1985. Learning to search: From weak methods to domain-specific heuristics. Cognitive Science, 9:217-260.
34. MACKWORTH, A. K. 1977. Consistency in networks of relations. Artificial Intelligence, 8:99-118.
35. MINTON, S. 1996. Automatically configuring constraint satisfaction programs: A case study. Constraints, 1(1/2):7-43.
36. MITCHELL, T., J. ALLEN, P. CHALASANI, J. CHENG, O. ETZIONI, M. N. RINGUETTE, and J. C. SCHLIMMER, Eds. 1991. Theo: A framework for self-improving systems. In Architectures for Intelligence. Erlbaum, Hillsdale, NJ.
37. NUDEL, B. 1983. Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics. Artificial Intelligence, 21:135-178.
38. PROSSER, P. 1993. Hybrid algorithms for constraint satisfaction problems. Computational Intelligence, 9(3):268-299.
39. RATTERMAN, M. J., and S. L. EPSTEIN. 1995. Skilled like a person: A comparison of human and computer game playing. In Seventeenth Annual Conference of the Cognitive Science Society, Erlbaum, Hillsdale, NJ.
40. ROSENBLOOM, P. S., A. NEWELL, and J. E. LAIRD. 1991. Toward the knowledge level in soar: The role of the architecture in the use of knowledge. In Architectures for Intelligence. Edited by K. VanLehn. Erlbaum, Hillsdale, NJ.
41. RUAN, Y., E. HORVITZ, and H. KAUTZ. 2004. The backdoor key: A path to understanding problem hardness. In AAAI-2004, AAAI Press, San Jose, CA.
42. SABIN, D., and E. C. FREUDER. 1997. Understanding and improving the MAC algorithm. In Principles and Practice of Constraint Programming. Springer Verlag, Berlin, pp. 167-181.
43. SCHLIMMER, J. G., and D. FISHER. 1986. A case study of incremental concept induction. In Fifth National Conference on Artificial Intelligence, Philadelphia.
44. SCHRAAGEN, J. M. 1993. How experts solve a novel problem in experimental design. Cognitive Science, 17(2):285-309.
45. SOLNON, C. 2002. Boosting ACO with a preprocessing step. In Evo Workshops 2002: Applications of Evolutionary Computing, Kinsale, Ireland.
46. SUTTON, R. S., and A. G. BARTO. 1998. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
47. TSANG, E. P. K. 1993. Foundations of Constraint Satisfaction. Academic Press, London.
48. WALSH, T. 1999. Search in a small world. In IJCAI-99, Morgan Kaufmann, Stockholm.