Learning when to use lazy learning in constraint solving

Frontiers in Artificial Intelligence and Applications

Volumn 215, Issue , 2010, Pages 873-878

  Gent, Ian P ^a   Jefferson, Chris ^a   Kotthoff, Lars ^a   Miguel, Ian ^a   Moore, Neil C A ^a   Nightingale, Peter ^a   Petrie, Karen ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); LOGIC PROGRAMMING;

CONSTRAINT SOLVING; LAZY LEARNING; LEARN+; MACHINE LEARNING APPROACHES; MACHINE-LEARNING; SATISFIABILITY MODULO THEORIES; SIMPLE++; SPEED UP; STANDARD MACHINES; THEORY SOLVERS;

LEARNING SYSTEMS;

EID: 77956051101     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-606-5-873     Document Type: Conference Paper

References (25)

1. C. Anśotegui, M. Sellmann, and K. Tierney, 'A gender-based genetic algorithm for the automatic configuration of algorithms', in CP, pp. 142-157, (2009).
2. N. Beldiceanu, M. Carlsson, and J.-X. Rampon, 'Global constraint catalog', Technical Report 08, Swedish Inst. of Comp. Sci., (2005).
3. J.E. Borrett, E.P.K. Tsang, and N.R. Walsh, 'Adaptive constraint satisfaction: The quickest first principle', in ECAI, pp. 160-164, (1996).
4. R. Dechter, Constraint Processing, Elsevier Science, 2003.
5. S.L. Epstein, E.C. Freuder, R.J. Wallace, A. Morozov, and B. Samuels, 'The adaptive constraint engine', in CP, pp. 525-542, (2002).
6. I.P. Gent, C. Jefferson, and I. Miguel, 'Minion: A fast scalable constraint solver.', in ECAI, pp. 98-102, (2006).
7. I.P. Gent, I. Miguel, and N.C.A. Moore, 'Lazy explanations for constraint propagator', in PADL 2010, pp. 217-233, (2010).
8. A. Guerri and M. Milano, 'Learning techniques for automatic algorithm portfolio selection', in Proc. ECAI 2004, pp. 475-479, (2004).
9. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, and I.H. Witten, 'The WEKA data mining software: An update', SIGKDD Explorations, 11(1), (2009).
10. F. Hutter, Y. Hamadi, H.H. Hoos, and K. Leyton-Brown, 'Performance prediction and automated tuning of randomized and parametric algorithms', in CP, pp. 213-228, (2006).
11. G. Katsirelos, Nogood Processing in CSPs, Ph.D. dissertation, University of Toronto, Jan 2009.
12. G. Katsirelos and F. Bacchus, 'Unrestricted nogood recording in CSP search', in CP, pp. 873-877, (2003).
13. G. Katsirelos and F. Bacchus, 'Generalized nogoods in CSPs', in AAAI, pp. 390-396, (2005).
14. A.R. KhudaBukhsh, L. Xu, H.H. Hoos, and K. Leyton-Brown, 'SATenstein: Automatically building local search SAT solvers from components', in IJCAI, pp. 517-524, (2009).
15. M.G. Lagoudakis and M.L. Littman, 'Reinforcement learning for algorithm selection', in AAAI/IAAI, p. 1081, (2000).
16. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham, 'A portfolio approach to algorithm selection', in IJCAI, pp. 1542-1542 Morgan Kaufmann, (2003).
17. B. McKay, 'Practical graph isomorphism', in Num. math. and comp., 10th Manitoba Conf., Congr. Numerantium 30, pp. 45-87, (1981).
18. S. Minton, 'Automatically configuring constraint satisfaction programs: A case study', Constraints, 1(1/2), 7-43, (1996).
19. T.M. Mitchell, Machine Learning, McGraw-Hill, 1997.
20. E. O'Mahony, E. Hebrard, A. Holland, C. Nugent, and B. O'Sullivan, 'Using case-based reasoning in an algorithm portfolio for constraint solving', in 19th Irish Conference on AI, (2008).
21. J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, 1993.
22. J.R. Rice, 'The algorithm selection problem', Advances in Computers, 15, 65-118, (1976).
23. D.J. Watts and S.H. Strogatz, 'Collective dynamics of 'small-world' networks', Nature, 393, 440-442, (1998).
24. I.H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann, 2nd edn., 2005.
25. L. Xu, F. Hutter, H.H. Hoos, and K. Leyton-Brown, 'SATzilla: Portfolio-based algorithm selection for SAT', J. Artif. Intell. Res. (JAIR), 32, 565-606, (2008).