Heuristic policy analysis and efficiency assessment in constraint satisfaction search

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2006, Pages 305-312

  Wallace, Richard J ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING; SYSTEMS ANALYSIS; TREES (MATHEMATICS);

CONSTRAINT SATISFACTION SEARCH; HEURISTIC POLICY ANALYSIS;

HEURISTIC METHODS;

EID: 38949208428     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2006.62     Document Type: Conference Paper

References (15)

1. J. C. Beck, P. Prosser, and R. J. Wallace. Toward understanding variable ordering heuristics for constraint satisfaction problems. In Fourteenth Irish Artificial Intelligence and Cognitive Science Conference-AICS'03, pages 11-16, 2003.
2. J. C. Beck, P. Prosser, and R. J. Wallace. Variable ordering heuristics show promise. In Principles and Practice of Constraint Programming-CP'04. LNCS No. 3258, pages 711-715, 2004.
3. J. C. Beck, P. Prosser, and R. J. Wallace. Trying again to fail-first. In Recent Advances in Constraints. Papers from the 2004 ERCIM/CologNet Workshop-CSCLP 2004. LNAI No. 3419, pages 41-55, Berlin, 2005. Springer.
4. C. Bessière, A. Chmeiss, and L. Sais. Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In Principles and Practice of Constraint Programming-CP'01. LNCS No. 2239, pages 565-569, 2001.
5. C. Bessière and J.-C. Regin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. Principles and Practice of Constraint Programming-CP '96, pages 61-75, 1996.
6. C. Bessière, B. Zanuttini, and C. Fernández. Measuring search trees. In ECAI 2004 Workshop on Modelling and Solving Problems with Constraints, pages 31-40, 2004.
7. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Boosting systematic search by weighting constraints. In Sixteenth European Conference on Artificial Intelligence-ECAI'04, pages 146-150, 2004.
8. P. A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems. In Tenth European Conference on Artificial Intelligence-ECAI'92, pages 31-35, 1992.
9. I. Gent, H. Hoos, P. Prosser, , and T. Walsh. Morphing: Combining structure and randomness. In Sixteenth National Conference on Artificial Intelligence- AAAI'99, pages 654-660, 1999.
10. I. Gent, E. MacIntyre, P. Prosser, B. Smith, and T. Walsh. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Principles and Practice of Constraint Programming-CP'96. LNCS No. 1118, pages 179-193, 1996.
11. R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-314, 1980.
12. J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.
13. T. Hulubei and B. OŚullivan. Optimal refutations for constraint satisfaction problems. In Nineteenth International Joint Conference on Artificial Intelligence, IJCAI'05, pages 163-168, 2005.
14. C. Lecoutre, F. Boussemart, and F. Hemery. Backjump-based techniques versus conflict-directed heuristics. In Sixteenth International Conference on Tools with Artificial Intelligence-ICTAI'04, pages 549-557, 2004.
15. B. M. Smith and S. A. Grant. Trying harder to fail first. In Thirteenth European Conference on Artificial Intelligence-ECAI'98, pages 249-253. John Wiley & Sons, 1998.