GAC on conjunctions of constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 610-614

  Katsirelos, George ^a   Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CSP MODEL;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947940052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_49     Document Type: Conference Paper

References (6)

1. C. Bessiere and J.-C. Regin. Local consistency on conjunctions of constraints. In Proceedings of the ECAI’98 Workshop on Non-binary constraints, pages 53–59, Brighton, UK, 1998.
2. A. K. Mackworth. On reading sketch maps. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pages 598–606, Cambridge, Mass., 1977.
3. J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceedings of the Second Canadian Conference on Artificial Intelligence, pages 268–277, Toronto, Ont., 1978.
4. D. Sabin and E. C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the 11th European Conference on Artificial Intelligence, pages 125–129, Amsterdam, 1994.
5. C. Bessiere and J.-C. Regin. Arc consistency for general constraint networks: Preliminary results. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 398–404, Nagoya, Japan, 1997.
6. B. Smith, K. Stergiou, and T. Walsh. Using auxilliary variables and implied constraints to model non-binary problems. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, Austin, Texas, 2000.