General symmetry breaking constraints

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

Volumn 4204 LNCS, Issue , 2006, Pages 650-664

  Walsh, Toby ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; PROBLEM SOLVING; SET THEORY;

CONDITIONAL SYMMETRIES; CONSTRAINT SATISFACTION PROBLEMS; PROPAGATORS; SYMMETRY BREAKING CONSTRAINTS;

CONSTRAINT THEORY;

EID: 33750381328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_46     Document Type: Conference Paper

References (25)

1. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In ISMIS'93. (1993) 350-361
2. Crawford, J., Luks, G., Ginsberg, M., Roy, A.: Symmetry breaking predicates for search problems. In 5th Int. Conf. on Knowledge Representation and Reasoning, (KR '96). (1996) 148-159
3. Petrie, K.E., Smith, B.M.: Symmetry Breaking in Graceful Graphs. Technical Report APES-56a-2003, APES Research Group (2003)
4. Puget, J.F.: An efficient way of breaking value symmetries. In 21st National Conf. on AI, (2006)
5. Kiziltan, Z.: Symmetry Breaking Ordering Constraints. PhD thesis, Dept. of Information Science, Uppsala University (2004)
6. Carlsson, M., Beldiceanu, N.: Arc-consistency for a chain of lexicographic ordering constraints. Technical report T2002-18, Swedish Institute of Computer Science (2002)
7. Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In Proc. of the 19th National Conf. on AI, (2004)
8. Puget, J.F.: Breaking all value symmetries in surjection problems. In 11th Int. Conf. on Principles and Practice of Constraint Programming (CP2005), (2005)
9. Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In 8th Int. Conf. on Principles and Practices of Constraint Programming (CP-2002), (2002)
10. Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38 (1989) 353-366
11. Law, Y., Lee, J.: Global constraints for integer and set value precedence. In 10th Int. Conf. on Principles and Practice of Constraint Programming (CP2004), (2004) 362-376
12. Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. In 11th Int. Conf. on Principles and Practice of Constraint Programming (CP2005). (2005) 17-31
13. Gent, I., Kelsey, T., Linton, S., McDonald, I., Miguel, I., Smith, B.: Conditional symmetry breaking. In 11th Int. Conf. on Principles and Practice of Constraint Programming (CP2005), (2005)
14. Walsh, T.: Symmetry breaking using value precedence. In 17th ECAI, IOS Press (2006)
15. Puget, J.F.: Breaking symmetries in all different problems. In 19th IJCAI, (2005) 272-277
16. Smith, B., Petrie, K., Gent, I.: Models and symmetry breaking for peacable armies of queens. In Proc. of the 1st Int. Conf. on Integration of AI and OR Techniques in Constraint Programming (CP-AI-OR), (2004) 271-286.
17. Sadler, A., Gervet, C.: Hybrid set domains to strengthen constraint propagation and reduce symmetries. In 10th Int. Conf. on Principles and Practice of Constraint Programming (CP2004), (2004)
18. Hawkins, P., Lagoon, V., Stuckey, P.: Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research 24 (2005) 109-156
19. Walsh, T.: Consistency and propagation with multiset constraints: A formal view-point. In 9th Int. Conf. on Principles and Practices of Constraint Programming (CP-2003), (2003)
20. Dooms, G., Deville, Y., Dupont, P.: CP(Graph): Introducing a graph computation domain in constraint programming. In 11th Int. Conf. on Principles and Practice of Constraint Programming (CP2005), (2005)
21. Aloul, F., Ramani, A., Markov, I., Sakallah, K.: Solving difficult SAT instances in the presence of symmetries. In Proc. of the Design Automation Conf., (2002) 731-736
22. Aloul, F., Sakallah, K., Markov, I.: Efficient symmetry breaking for Boolean satisfiability. In 18th IJCAI (2003) 271-276
23. Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. In Proc. of LICS workshop on Theory and Applications of Satisfiability Testing (SAT 2001). (2001)
24. Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetry in matrix models. In 8th Int. Conf. on Principles and Practices of Constraint Programming (CP-2002), (2002)
25. Law, Y., Lee, J.: Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction. Constraints (2006) to appear.