Permutation problems and channelling constraints

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

Volumn 2250, Issue , 2001, Pages 377-391

  Walsh, Toby ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CHANNELLING CONSTRAINT; CONSTRAINT MODEL; CONSTRAINT PROGRAMS; DECISION VARIABLES; DUAL REPRESENTATION; EMPIRICAL STUDIES; GENERAL METHODOLOGIES; PERMUTATION PROBLEMS;

DECISION MAKING;

EID: 84937406521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_26     Document Type: Conference Paper

References (14)

1. Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, and Bart Selman. Generating satisfiable problems instances. In Proc. of 17th National Conference on Artificial Intelligence, pages 256-261. 2000.
2. R. Bejar and F. Manya. Solving the round robin problem using propositional logic. In Proc. of 17th National Conference on Artificial Intelligence, pages 262-266. 2000.
3. C. Bessière, P. Meseguer, E. C. Freuder, and J. Larrosa. Onforward checking for nonbinary constraint satisfaction. In Proc. of 5th Int. Conf. on Principles and Practice of Constraint Programming (CP99), pages 88-102. 1999.
4. B. M. W. Cheng, K. M. F. Choi, J. H. M. Lee, and J. C. K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4:167-192, 1999.
5. Xinguang Chen. A Theoretical Comparison of Selected CSP Solving and Modelling Techniques. PhD thesis, Dept. of Computing Science, University of Alberta, 2000.
6. R. Debruyne and C. Bessière. Some practicablefiltering techniques for the constraint satisfaction problem. In Proc. of the 15th IJCAI, pages 412-417. 1997.
7. I. P. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence, 123(1-2):133-156, 2000.
8. P. Van Hentenryck, Y. Deville, and C. Teng. A Generic Arc Consistency Algorithm and its Specializations. Artificial Intelligence, 57:291-321, 1992.
9. P. Prosser, K. Stergiou, and T. Walsh. Singelton consistencies. In Proc of 6th Int. Conf. on Principles and Practices of Constraint Programming (CP-2000), pages 353-368. 2000.
10. J. C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proc. of the 12th National Conference on AI, pages 362-367. 1994.
11. J. C. Régin and M. Rueher. A global constraint combining a sum constraint and difference constraints. In Proc. of 6th Int. Conf. on Principles and Practice of Constraint Programming (CP2000), pages 384-395. 2000.
12. B. M. Smith. Modelling a Permutation Problem. In Proc. of ECAI'2000 Workshop on Modelling and Solving Problems with Constraints, 2000.
13. K. Stergiou and T. Walsh. The difference all-difference makes. In Proceedings of 16th IJCAI. 1999.
14. T. Walsh. SAT v CSP. In Proc. of 6th Int. Conf. on Principles and Practices of Constraint Programming (CP-2000), pages 441-456. 2000.