Constraint satisfaction problems: Backtrack search revisited

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 252-257

  Chmeiss, Assef ^a   Saïs, Lakhdar ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Constraint satisfaction; Forward Checking; Maintaining arc consistency; Search

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTRAINT SATISFACTION; FORWARD CHECKING (FC); MAINTAINING ARC CONSISTENCY (MAC); SEARCH;

CONSTRAINT THEORY;

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

References (17)

1. F.Bacchus. Extending forward checking. In Proceedings of CP'2000, pages 35-51, 2000.
2. C. Bessiere. Arc consistency and arc consistency again. Artificial Intelligence, 65:179-190, 1994.
3. C. Bessiere, E. Freuder, and J. Regin. Using constraint meta-knowledge to reduce arc consistency computation. Artificial Intelligence, 107:125-148, 1999.
4. C. Bessiere and J. Regin. MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP'96, pages 61-75, 1996.
5. J. Binter and E. Reingold. Backtracking programming techniques. Communications of the ACM, 18(11):651-656, 1975.
6. A. Chmeiss and P. Jegou. Efficient path-consistency propagation. International Journal on Artificial Intelligence Tools, 7(2): 121-142, 1998.
7. R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, 2003.
8. D. Frost, R. Dechter, C. Bessière, and J. Régin. Random uniform CSP generators. http://www.lirmm.fr/ bessiere/generator.html, 1996.
9. J. Gaschnig. Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisfying assignments problems. In Canadian Artificial Intelligence Conference, pages 268-277, 1978.
10. M. Ginsberg. Dynamic backtracking. Artificial Intelligence, 1:25-46, 1993.
11. S. Golomb and L. Baumert. Backtrack programming. JACM, 12:516-524, 1965.
12. R. Mohr and T. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225-233, 1986.
13. P. Prosser. Hybrid algorithms for the constraint satisfaction problems. Computational Intelligence, 9(3):268-299, 1993.
14. D. Sabin and E. freuder. Contradicting conventional wisdom in constraint satisfaction. In ECAI'94, 1994.
15. D. Sabin and E. C. Freuder. Understanding and improving the mac algorithm. In CP'97, 1997.
16. B. Smith and S. Grant. Trying harder to fail first. In Proceedings of ECAI'98, pages 249-253, Brighton, UK, 1998.
17. d an efficient arc consistency algorithm with a low space complexity. In Proceedings of CP'02, pages 755-760, 2002.