C. Bessiere, H. Fargier, and C. Lecoutre, Global inverse consistency for interactive constraint satisfaction, Proceedings of CP'13, pp.159-174, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01147298

P. Janssen, P. Jégou, B. Nouguier, M. Vilarem, and B. Castro, SYNTHIA: Assisted design of peptide synthesis plans, New Journal of Chemistry, vol.14, issue.12, pp.969-976, 1990.

E. Gelle and R. Weigel, Interactive configuration using constraint satisfaction techniques, Proceedings of PACT'96, pp.37-44, 1996.

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.

T. Hadzic and H. Andersen, Interactive reconfiguration in power supply restoration, Proceedings of CP'05, pp.767-771, 2005.

T. Hadzic, E. Hansen, and B. O'sullivan, Layer compression in decision diagrams, Proceedings of ICTAI'08, pp.19-26, 2008.

R. Debruyne and C. Bessiere, Domain filtering consistencies, Journal of Artificial Intelligence Research, vol.14, pp.205-230, 2001.

E. Freuder and C. Elfe, Neighborhood inverse consistency preprocessing, Proceedings of AAAI'96, pp.202-208, 1996.

D. Martinez, Résolution interactive de problemes de satisfaction de contraintes, 1998.

D. Sabin and E. Freuder, Contradicting conventional wisdom in constraint satisfaction, pp.10-20, 1994.

E. Freuder, A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, issue.4, pp.755-761, 1985.

E. Freuder, Completable representations of constraint satisfaction problems, Proceedings of KR'91, pp.186-195, 1991.

R. Dechter, From local to global consistency, Artificial Intelligence, vol.55, issue.1, pp.87-108, 1992.

U. Montanari, Network of constraints : Fundamental properties and applications to picture processing, Information Science, vol.7, pp.95-132, 1974.

J. Astesana, L. Cosserat, and H. Fargier, Constraint-based vehicle configuration: A case study, Proceedings of ICTAI'10, pp.68-75, 2010.

C. Papadimitriou, , 1999.

G. Gottlob, On minimal constraint networks, Artificial Intelligence, pp.42-60, 2012.

K. Bayer, M. Michalowski, B. Choueiry, and C. Knoblock, Reformulating CSPs for scalability with application to geospatial reasoning, Proceedings of CP'07, pp.164-179, 2007.

J. Ullmann, Partition search for non-binary constraint satisfaction, Information Science, vol.177, pp.3639-3678, 2007.

C. Lecoutre, STR2: Optimized simple tabular reduction for table constraints, Constraints, vol.16, issue.4, pp.341-371, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00868225

C. Schulte, Comparing trailing and copying for constraint programming, Proceedings of ICLP'99, pp.275-289, 1999.

M. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.

C. Lecoutre, C. Likitvivatanavong, and R. Yap, STR3: A path-optimal filtering algorithm for table constraints, Artificial Intelligence, vol.220, pp.1-27, 2015.

C. Bessiere, P. Meseguer, E. Freuder, and J. Larrosa, On Forward Checking for non-binary constraint satisfaction, Artificial Intelligence, vol.141, pp.205-224, 2002.
URL : https://hal.archives-ouvertes.fr/lirmm-00268449

E. Hebrard, B. Hnich, B. O'sullivan, and T. Walsh, Finding diverse and similar solutions in constraint programming, Proceedings of AAAI'05, pp.372-377, 2005.