J. Amilhastre, H. Fargier, and P. Marquis, Consistency restoration and explanations in dynamic CSPs???Application to configuration, Artificial Intelligence, vol.135, issue.1-2, pp.199-234, 2002.
DOI : 10.1016/S0004-3702(01)00162-X

R. Backofen and S. Will, Excluding Symmetries in Constraint-Based Search, Principles and Practice of Constraint Programming, pp.73-87, 1999.
DOI : 10.1007/978-3-540-48085-3_6

V. Barker, D. O. Connor, J. Bachant, and E. Soloway, Expert systems for configuration at Digital: XCON and beyond, Communications of the ACM, vol.32, issue.3, pp.298-318, 1989.
DOI : 10.1145/62065.62067

D. Cohen, P. Jeavons, C. Jefferson, K. E. Petrie, and B. M. Smith, Symmetry Definitions for Constraint Satisfaction Problems, Constraints, vol.129, issue.2-3, pp.115-137, 2006.
DOI : 10.1007/s10601-006-8059-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.2244

J. François and P. , Dynamic lex constraints, Principles and Practice of. Constraint Programming -CP 2006, pp.453-467, 2006.

J. Crawford, M. L. Ginsberg, E. Luck, and A. Roy, Symmetry-breaking predicates for search problems, KR'96 : Principles of Knowledge Representation and Reasoning, pp.148-159, 1996.

I. P. Gent and B. M. Smith, Symmetry breaking in constraint programming, 14th European Conference on Artificial Intelligence, pp.599-603, 2000.

I. Gent, W. Harvey, and T. Kelsey, Groups and Constraints: Symmetry Breaking during Search, Principles and Practice of. Constraint Programming -CP 2002 -LNCS 2470, pp.415-431, 2002.
DOI : 10.1007/3-540-46135-3_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5858

L. Henocque, M. Kleiner, and N. Prcovic, Advances in Polytime Isomorph Elimination for Configuration, proceedings of Principles and Practice of Constraint Programming -CP 2005, pp.301-313, 2005.
DOI : 10.1007/11564751_24

L. Henocque and N. Prcovic, Practically handling configuration automorphisms, proceedings of the 16th IEEE International Conference on Tools for Artificial Intelligence, 2004.

. Régin, Constraint programming in opl [12] Z. Kiziltan and B. Hnich. Symmetry breaking in a rack configuration problem, Principles and Practice of Declarative Programming Proc. of the IJCAI'01 Workshop on Modelling and Solving Problems with Constraints, 1999.

E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences, vol.25, issue.1, pp.42-49, 1982.
DOI : 10.1016/0022-0000(82)90009-5

D. Mailharro, A classification and constraintbased framework for configuration, AI in Engineering , Design and Manufacturing, issue.12, pp.383-397, 1998.

S. Mittal and B. Falkenhainer, Dynamic constraint satisfaction problems, Proceedings of AAAI-90, pp.25-32, 1990.

D. Sabin and E. C. Freuder, Composite constraint satisfaction, Artificial Intelligence and Manufacturing Research Planning Workshop, pp.153-161, 1996.

T. Soininen, I. Niemela, J. Tiihonen, and R. Sulonen, Representing configuration knowledge with weight constraint rules, Proceedings of the AAAI Spring Symp. on Answer Set Programming : Towards Efficient and Scalable Knowledge, pp.195-201, 2001.

M. Stumptner, An overview of knowledge-based configuration, pp.111-125, 1997.