N. Beldiceanu and H. Simonis, A Model Seeker: Extracting Global Constraint Models from Positive Examples, Proceedings of the Seventeenth International Conference on Principles and Practice of Constraint Programming (CP'12), pp.141-157, 2012.
DOI : 10.1007/978-3-642-33558-7_13
URL : https://hal.archives-ouvertes.fr/hal-00754361

C. Bessiere, R. Coletta, E. Freuder, and B. O. Sullivan, Leveraging the Learning Power of Examples in Automated Constraint Acquisition, Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming, pp.123-137, 2004.
DOI : 10.1007/978-3-540-30201-8_12
URL : https://hal.archives-ouvertes.fr/lirmm-00108774

C. Bessiere, R. Coletta, E. Hebrard, G. Katsirelos, N. Lazaar et al., Constraint acquisition via partial queries, Proceedings of the Twenty- Third International Joint Conference on Artificial Intelligence (IJCAI'13), pp.475-481, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00830325

C. Bessiere, R. Coletta, F. Koriche, and B. O. Sullivan, A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems, Proceedings of the European Conference on Machine Learning (ECML'05), LNAI, pp.23-34, 2005.
DOI : 10.1007/11564096_8
URL : https://hal.archives-ouvertes.fr/lirmm-00106044

C. Bessiere, R. Coletta, B. O. Sullivan, and M. Paulin, Querydriven constraint acquisition, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJ- CAI'07), pp.44-49, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00195905

C. Bessiere, R. Coletta, F. Koriche, A. Lallouet, and M. Lopez, Branch and learn pour l'acquisition de csp, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00752314

E. C. Freuder and R. J. Wallace, Suggestion strategies for constraint-based matchmaker agents, Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP'98), pp.192-204, 1998.

M. Gelain, M. S. Pini, F. Rossi, K. B. Venable, and T. Walsh, Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies, Artificial Intelligence, vol.174, issue.3-4, pp.3-4270, 2010.
DOI : 10.1016/j.artint.2009.11.015

I. P. Gent and T. Walsh, CSPlib: A Benchmark Library for Constraints, 1999.
DOI : 10.1007/978-3-540-48085-3_36

J. Huang, The effect of restarts on the efficiency of clause learning, IJCAI, pp.2318-2323, 2007.

U. Junker, Quickxplain: Preferred explanations and relaxations for over-constrained problems, Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI'04), pp.167-172, 2004.

A. Lallouet, M. Lopez, L. Martin, and C. Vrain, On learning constraint problems Optimal speedup of las vegas algorithms, Proceedings of the 22nd IEEE International Conference on Tools for Artificial Intelligence (IEEE-ICTAI'10), pp.45-52173, 1993.

J. Mason, Purdey's general store, 1997.

T. Walsh, Search in a small world, IJCAI, pp.1172-1177, 1999.