Learning from failure in constraint satisfaction search

AAAI Workshop - Technical Report

Volumn WS-06-11, Issue , 2006, Pages 7-14

  Grimes, Diarmuid ^a   Wallace, Richard J ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTRAINT SATISFACTION PROBLEM; HEURISTICS POWER; WEIGHTED-DEGREE HEURISTICS;

FAILURE ANALYSIS;

EID: 33846000324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Boussemart, F.; Hemery, F.; Lecoutre, C.; and Sais, L. 2004. Boosting systematic search by weighting constraints. In Proc. Sixteenth European Conference on Artificial Intelligence-ECAI'04, 146-150.
2. Eisenberg, C., and Faltings, B. 2003. Using the break-out algorithm to identify hard and unsolvable subproblems. In Rossi, F., ed., Principles and Practice of Constraint Programming-CP'03. LNCS No. 2833, 822-826.
3. Geelen, P. A. 1992. Dual viewpoint heuristics for binary constraint satisfaction problems. In Proc. Tenth European Conference on Artificial Intelligence-ECAI'92, 31-35.
4. Haralick, R. M., and Elliott, G. L. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14:263-314.
5. Hays, W. L. 1973. Statistics for the Social Sciences. Holt, Rinehart, Winston, 2nd edition.
6. Hulubei, T., and O'Sullivan, B. 2006. The impact of search heuristics on heavy-tailed behaviour. Constraints Journal 11:157-176.
7. Joslin, D., and Clements, D. 1998. Squeaky wheel optimization. In Proc. Sixteenth National Conference on Artificial Intelligence-AAAI'98, 340-346.
8. Katsirelos, G., and Bacchus, F. 2005. Generalized nogoods in CSPs. In Proc. Twentieth National Conference on Artificial Intelligence-AAAI'05, 390-396.
9. Lecoutre, C.; Boussemart, F.; and Hemery, F 2004. Backjump-based techniques versus conflict-directed heuristics. In Sixteenth International Conference on Tools with Artificial Intelligence-ICTAI'04, 549-557.
10. Morris, P. 1993. The breakout method for escaping from local minima. In Proc. Eleventh National Conference on Artificial Intelligence-AAAI'93, 40-45.
11. Moskewicz, M.; Madigan, C.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proc. Design Automation Conference, 530-535.
12. Refalo, P. 2004. Impact-based search strategies for constraint programming. In Wallace, M., ed., Principles and Practice of Constraint Programming-CP'04. LNCS No. 3258, 557-571.
13. Selman, B., and Kautz, H. 1993. Domain-independent extensions to GSAT : solving large structured satisfiability problems. In Proceedings of IJCAI '93, 290-295.
14. Sleeman, D.; Langley, P.; and Mitchell, T. M. 1982. Learning from solution paths: An approach to the credit assignment problem. AI Magazine 3:48-52.
15. Tompkins, D. A. D., and Hoos, H. H. 2004. Warped landscapes and random acts of SAT solving. In Proc. Eight International Symposium on Artificial Intelligence and Mathematics-ISAIM04.