Symmetry definitions for constraint satisfaction problems

Constraints

Volumn 11, Issue 2-3, 2006, Pages 115-137

  Cohen, David ^a   Jeavons, Peter ^b   Jefferson, Christopher ^c   Petrie, Karen E ^c   Smith, Barbara M ^d  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF ST ANDREWS   (United Kingdom)

^d UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Constraint satisfaction problems; Symmetry

Indexed keywords

GRAPH THEORY; MICROSTRUCTURE; PROBLEM SOLVING;

AUTOMORPHISM; CONSTRAINT SATISFACTION PROBLEMS (CSP); HYPERGRAPH; SYMMETRY;

CONSTRAINT THEORY;

EID: 33745225485     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-006-8059-8     Document Type: Conference Paper

References (22)

1. Aguirre, A. (1992). How to use symmetries in Boolean constraint solving. In F. Benhamou & A. Colmerauer (Eds.), Constraint Logic Programming: Selected Research (pp. 287-306). MIT Press.
2. Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In J. Jaffar (Ed.), Principles and Practice of Constraint Programming-CP'99, LNCS 1713, (pp. 73-87). Berlin Heidelberg New York: Springer.
3. Benhamou,B.(1994).Studyofsymmetryinconstraintsatisfactionproblems. InProceedzngs of the 2nd Workshop on Principles and Practice of Constraint Programming, {PPCP'94} (pp. 246-254).
4. Benhamou, B., & Sais, L. (1992). Theoretical study of symmetries in prepositional calculus and applications. In D. Kapur (Ed.), Automated Deduction - CADE-11, LNAI 607, (pp. 281-294). Berlin Heidelberg New York: Springer.
5. Bessière, C., Hebrard, E., Hnich, B., & Walsh, T. (2004) The tractability of global constraints. In M. Wallace (Ed.), Principles and Practice of Constraint Programming - CP 2004, Vol. LNCS 3258, (pp. 716-720). Berlin Heidelberg New York: Springer.
6. Brown, C. A., Finkelstein, L., & Purdom, J. P. W. (1988). Backtrack searching in the presence of symmetry. In T. Mora (Ed.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS 357, (pp. 99-110). Berlin Heidelberg New York: Springer.
7. Crawford, J., Ginsberg, M., Luks, E., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In Proceedings KR'96 (pp. 149-159).
8. Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In T. Walsh (Ed.), Principles and Practice of Constraint Programming - CP 2001, LNCS 2239, (pp. 225-239). Berlin Heidelberg New York: Springer.
9. Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In T. Walsh (Ed.), Principles and Practice of Constraint Programming - CP 2001, LNCS 2239, (pp. 77-92). Berlin Heidelberg New York: Springer.
10. Freuder, E. C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings AAAP91, Vol. 1, (pp. 227-233).
11. The GAP Group. (2005). GAP - Groups, Algorithms, and Programming, Version 4.4. (http://www.gap-system.org).
12. Gent, I. P., Harvey, W., Kelsey, T., & Linton, S. (2003). Generic SBDD using computational group theory. In F. Rossi (Ed.), Principles and Practice of Constraint Programming - CP 2003, LNCS. Berlin Heidelberg New York: Springer.
13. Gent, I. P., & Smith, B. M. (2000). Symmetry breaking during search in constraint programming. In W. Horn (Ed.), Proceedings ECAI'2000, the European Conference on Artificial Intelligence (pp. 599-603).
14. Jégou, P. (1993). Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In Proceedings AAAI'93 (pp. 731-736).
15. McKay, B. (1981). Practical graph isomorphism. Congressus Numerantium, 30, 45-87. (The software tool NAUTY is available for download from http://cs.anu.edu.au/~bdm/nauty/).
16. Meseguer, P., & Torras, C. (2001). Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129, 133-163.
17. Petrie, K. E., & Smith, B. M. (2003). Symmetry breaking in graceful graphs. In F. Rossi (Ed.), Principles and Practice of Constraint Programming - CP 2003, LNCS 2833, (pp. 930-934). Berlin Heidelberg New York: Springer.
18. Puget, J.-F. (1993). On the satisfiability of symmetrical constrained satisfaction problems. In J. Komorowski & Z. W. Ras (Eds.), Methodologies for Intelligent Systems (Proceedings of ISMIS'93), LNAI 689, (pp. 350-361). Berlin Heidelberg New York: Springer.
19. Puget, J.-F. (2005). Automatic detection of variable and value symmetries. In P. van Beek (Ed.), Principles and Practice of Constraint Programming - CP 2005, LNCS 3709, (pp. 475-489). Berlin Heidelberg New York: Springer.
20. Ramani, A., & Markov, I. L. (2005). Automatically exploiting symmetries in constraint programming. In B. Fallings, A. Petcu, F. Fages & F. Rossi (Eds.), Recent Advances in Constraints, Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, LNCS 3419, (pp. 98-112). Berlin Heidelberg New York: Springer.
21. Roy, P., & Pachet, F. (1998). Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In Workshop on Non Binary Constraints, ECAI-98.
22. Walsh, T. (2000). SAT v CSP. In Proceedings CP'2000 (pp. 441-456).