Transposition tables for constraint satisfaction

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 243-248

  Lecoutre, Christophe ^a   Sais, Lakhdar ^a   Tabary, Sébastien ^a   Vidal, Vincent ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; ONLINE SEARCHING;

CONSTRAINT SATISFACTION PROBLEM (CSP); STATE-BASED APPROACH; TRANSPOSITION TABLES;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. Bessiere, C., and Régin, J. 1996. MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP'96, 61-75.
2. Bessiere, C. 2006. Constraint propagation. In Handbook of Constraint Programming. Elsevier, chapter 3.
3. Boussemart, F.; Hemery, F.; Lecoutre, C.; and Sais, L. 2004. Boosting systematic search by weighting constraints. In Proceedings of ECAI'04, 146-150.
4. Cohen, D.; Jeavons, P.; Jefferson, C.; Pétrie, K.; and Smith, B. 2006. Symmetry definitions for constraint satisfaction problems. Constraints 11(2-3): 115-137.
5. Debruyne, R., and Bessiere, C. 2001. Domain filtering consistencies. Journal of Artificial Intelligence Research 14:205-230.
6. Dechter, R. 1990. Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition. Artificial Intelligence 41:273-312.
7. Fahle, T.; Schamberger, S.; and Sellman, M. 2001. Symmetry breaking. In Proceedings of CP'01, 93-107.
8. Focacci, F., and Milano, M. 2001. Global cut framework for removing symmetries. In Proceedings of CP'01, 77-92.
9. Freuder, E. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI'91, 227-233.
10. Greenblatt, R.; Eastlake, D.; and Crocker, S. 1967. The Greenblatt chess program. In Proceedings of Fall Joint Computer Conference, 801-810.
11. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
12. Marsland, T. 1992. Computer chess and search. In Encyclopedia of Artificial Intelligence. J. Wiley & Sons. 224-241.
13. Puget, J. 2005. Symmetry breaking revisited. Constraints 10(1):23-46.
14. Reinefeld, A., and Marsland, T. A. 1994. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7):701-710.
15. Slate, D., and Atkin, L. 1977. Chess 4.5: The northwestern university chess program. In Chess Skill in Man and Machine. Springer Verlag. 82-118.
16. Vidal, V. 2004. A lookahead strategy for heuristic search planning. In Proceedings of ICAPS'04, 150-159.
17. Zobrist, A. L. 1970. A new hashing method with applications for game playing. Technical Report 88, Computer Sciences Dept., Univ. of Wisconsin.