Local symmetry breaking during search in CSPs

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

Volumn 4741 LNCS, Issue , 2007, Pages 195-209

  Benhamou, Belaïd ^a   Saïdi, Mohamed Réda ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ENGINEERING RESEARCH; PROBLEM SOLVING; TREES (MATHEMATICS);

GLOBAL SYMMETRY; SEARCH METHODS; SYMMETRICAL PROBLEMS;

GLOBAL OPTIMIZATION;

EID: 38149137288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_16     Document Type: Conference Paper

References (33)

1. Krishnamurty, B.: Short proofs for tricky formulas. Acta informática 22, 253-275 (1985)
2. Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and application. In: Eleventh International Conference on Automated Deduction, Saratoga Springs, NY, USA (1992)
3. Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. Journal of Automated Reasoning (JAR) 12, 89-102 (1994)
4. Benhamou, B., Sais, L., Siegel, P.: Two proof procedures for a cardinality based language. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 94. LNCS, vol. 775, pp. 71-82. Springer, Heidelberg (1994)
5. Freuder, E.: Eliminating interchangeable values in constraints satisfaction problems. In: Proc AAAI-91, pp. 227-233 (1991)
6. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689. Springer, Heidelberg (1993)
7. Benhamou, B.: Study of symmetry in constraint satisfaction problems. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874. Springer, Heidelberg (1994)
8. Crawford, J., Ginsberg, M.L., Luck, E., Roy, A.: Symmetry-breaking predicates for search problems. In: KR'96. Principles of Knowledge Representation and Reasoning, pp. 148-159. Morgan Kaufmann, San Francisco, California (1996)
9. Aloul, F.A., Ramani, A., Markov, I.L., Sakallak, K.A.: Solving difficult sat instances in the presence of symmetry. IEEE Transaction on CAD 22(9), 1117-1137 (2003)
10. Aloul, F.A., Ramani, A., Markov, I.L., Sakallak, K.A.: Symmetry breaking for pseudo-boolean satisfiabilty. In: ASPDAC'04, pp. 884-887 (2004)
11. Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Jaffar, J. (ed.) Principles and Practice of Constraint Programming - CP'99. LNCS, vol. 1713. Springer, Heidelberg (1999)
12. Gent, I.P., Smith, B.M.: Symmetry breaking during search in constraint programming. In: Proceedings ECAP2000 (2000)
13. Gent, I., Harvey, W., Kelsey, T.: Groups and constraints: Symmetry breaking during search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 415-430. Springer, Heidelberg (2002)
14. Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77-82. Springer, Heidelberg (2001)
15. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93-108. Springer, Heidelberg (2001)
16. Puget, J.: Symmetry breaking revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 446-461. Springer, Heidelberg (2002)
17. Gent, I.P., Hervey, W., Kesley, T., Linton, S.: Generic sbdd using computational group theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833. Springer, Heidelberg (2003)
18. Roney-Dougal, C.M., Gent, I.P., Kelsey, T., Linton, S.A.: Tractable symmetry breaking using restricted search trees. In: Proceedings of ECAI'04, pp. 211-215 (2004)
19. Puget, J.: Breaking symmetries in all diffrent problems. In: Proceedings of IJCAI, pp. 272-277 (2005)
20. Puget, J.: Breaking all value symmetries in surjection problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 490-504. Springer, Heidelberg (2005)
21. Gohen, D., Jeavons, P., Jefferson, C., Pétrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17-31. Springer, Heidelberg (2005)
22. Puget, J.: Dynamic lex constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 453-467. Springer, Heidelberg (2006)
23. Walsh, T.: General symmetry breaking constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 650-664. Springer, Heidelberg (2006)
24. Gent, I.P., Kelsey, T., Linton, S.A., McDonald, I., Migeul, I., Smith, B.: Conditional symmetry breaking. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 256-270. Springer, Heidelberg (2005)
25. Zampelli, S., Deville, Y., Dupont, P.: Symmetry breaking in subgraph pattern matching. In: SymCon'06, pp. 35-42 (2006)
26. Jegou, P.: Decomposition of domains based on the micro-structure of finite constraint satisfaction problems. In: Proceedings AAAI'93 (1993)
27. Benhamou, B., Saïdi, M.R.: Reasoning by dominance in not-equals binary constraint networks. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 670-674. Springer, Heidelberg (2006)
28. Benhamou, B., Saïdi, M.R.: Some improvements in symmetry elimination in notequals binary constraint networks. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 1-7. Springer, Heidelberg (2005)
29. Haralik, R.M., Elliot, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263-313 (1980)
30. McKay, B.: Practical graph isomorphism. Congr. Numer. 30, 45-87 (1981)
31. Puget, J.F.: Automatic detection of variable and value symmetries. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 474-488. Springer, Heidelberg (2005)
32. Mears, C., de la Banda, M.G., Wallace, M.: On implementing symmetry detection. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 1-8. Springer, Heidelberg (2006)
33. Zampelli, S., Deville, Y., Saïdi, M.R., Benhamou, B., Dupont, P.: Breaking local symmetries in subgraph pattern matching. In: The International Symmetry Conference (ISC 2007), Edinburgh, SCOTLAND (2007)