Symmetry-breaking as a prelude to implied constraints: A constraint modelling pattern

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 171-175

  Frisch, Alan M ^a   Jefferson, Christopher ^a   Miguel, Ian ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS;

CONSTRAINTS MODELS; EMERGING PATTERNS; FINITE-DOMAIN CONSTRAINT PROGRAMMING; MODELING PROCESS; PROBLEM SOLUTIONS; SYMMETRY BREAKING CONSTRAINTS; SYMMETRY BREAKINGS;

CONSTRAINT THEORY;

EID: 85017361958     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. R. Backofen and S. Will. Excluding symmetries in concurrent constraint programming. Proc. 5th Int. Conf. on Princ. & Pract. of CP (LNCS 1713), 73-87, 1999.
2. J. Crawford, M.L. Ginsberg, E. Luks, A. Roy. Symmetry-breaking predicates for search problems. Proc. Princ. of Knowledge Representation & Reasoning, 148-159, 1996.
3. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
4. T. Fahle, S. Shamberger, M. Sellman. Symmetry breaking. Proc. 7thInt. Conf. onPrinc. & Pract. of CP(LNCS 2239), 93-107, 2001.
5. P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Matrix modelling: Exploiting common patterns in constraint programming. Proc. Int. Wshop on Reformulating CSPs, 227-41, 2002.
6. P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, T. Walsh. Breaking row and column symmetries in matrix models. Proc. 8th Int. Conf. on Princ. & Pract. of CP (LNCS 2470), 462-476, 2002.
7. A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Global constraints for lexicographic orderings. Proc. 8th Int. Conf. on Princ. & Pract. of CP (LNCS 2470), 93-108, 2002.
8. A.M. Frisch, C. Jefferson, B. Martinez-Hernandez, I. Miguel. The Rules of Modelling: Automatic Generation of Constraint Programs. APES Technical Report 85, 2004.
9. A.M. Frisch, C. Jefferson, I. Miguel. Constraints for breaking more row and column symmetries. Proc. 9th Int. Conf. on Princ. & Pract. of CP (LNCS 2833), 318-332, 2003.
10. A.M. Frisch, I. Miguel, Z. Kiziltan, B. Hnich, T. Walsh. Multiset ordering constraints. Proc. 18th Int. Joint Conf. on AI, 2003.
11. A.M. Frisch, I. Miguel, T. Walsh. Extensions to proof planning for generating implied constraints. Proc. 9th Symp. on Integration of Symb. Comp. & Mech. Reasoning (Calculemus 01), 130-141, 2001.
12. A.M. Frisch, I. Miguel, T. Walsh. Symmetry and implied constraints in the steel mill slab design problem. Proc. CP'01 Wshop on Modelling and Problem Formulation, 8-15, 2001.
13. I.P. Gent, W. Harvey, T. Kelsey. Groups and constraints: Symmetry breaking during search. Proc. 8th Int. Conf. on Princ. & Pract. of CP (LNCS 2470), 415-430, 2002.
14. I.P. Gent, B.M. Smith. Symmetry breaking during search in constraint programming. Proc. 14thEuro. Conf. onAI, 599-603, 2000.
15. J. Pearson. Comma-free codes. Proc. 3rd Int. Wshop on Symmetry in Constraint Satisfaction Problems, 161-167, 2003.
16. L. Proll, B.M. Smith. ILP and constraint programming approaches to a template design problem. INFORMS Journal of Computing 10, 265-275, 1998.
17. J-F.Puget. Symmetry breaking using stabilizers. Proc. 9th Int. Conf. on Princ. & Pract. of CP (LNCS 2833), 585-599, 2003.
18. M. Sellmann, W. Harvey. Heuristic constraint propagation (using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem). Proc. 4th Int. Wshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR), 191-204, 2002.
19. T. Walsh. Constraint patterns. Proc. 9th Int. Conf. on Princ. & Pract. of CP (LNCS 2833), 53-64, 2003.