E. Arafailova, N. Beldiceanu, R. Douence, M. Carlsson, P. Flener et al., Global constraint catalog, volume ii, time-series constraints, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01374721

E. Arafailova, N. Beldiceanu, and H. Simonis, Generating Linear Invariants for a Conjunction of Automata Constraints, Principles and Practice of Constraint Programming -CP 2017, 23rd International Conference CP 2017
DOI : 10.1007/3-540-45578-7_13
URL : https://hal.archives-ouvertes.fr/hal-01651593

N. Beldiceanu, P. Flener, J. Monette, J. Pearson, and H. Simonis, Toward sustainable development in constraint programming, Constraints, vol.31, issue.6, pp.139-149, 2014.
DOI : 10.1287/inte.31.6.29.9647
URL : https://hal.archives-ouvertes.fr/hal-01086761

J. W. Charnley, S. Colton, and I. Miguel, Automatic generation of implied constraints

T. Coquand and G. P. Huet, Constructions: A higher order proof system for mechanizing mathematics, European Conference on Computer Algebra Proceedings Volume 1: Invited Lectures, pp.151-184, 1985.
DOI : 10.1007/3-540-15983-5_13
URL : https://hal.archives-ouvertes.fr/inria-00076155

S. Fajtlowicz, On Conjectures of Graffiti, Annals of Discrete Mathematics, vol.38, pp.113-118, 1988.
DOI : 10.1016/S0167-5060(08)70776-3

E. C. Freuder, In pursuit of the holy grail, ACM Computing Surveys, vol.28, issue.4es, pp.57-611009749006768, 1997.
DOI : 10.1145/242224.242304

N. Goel, M. S. Hsiao, N. Ramakrishnan, and M. J. Zaki, Mining Complex Boolean Expressions for Sequential Equivalence Checking, 2010 19th IEEE Asian Test Symposium, pp.442-447, 2010.
DOI : 10.1109/ATS.2010.81
URL : http://www.cs.vt.edu/%7Eramakris/papers/ats10.pdf

P. Hansen and G. Caporossi, AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory, Electronic Notes in Discrete Mathematics, vol.5, pp.158-161, 2000.
DOI : 10.1016/S1571-0653(05)80151-9

S. Krishna, C. Puhrsch, and T. Wies, Learning Invariants using Decision Trees

I. Lakatos, Proofs and Refutations, 1976.

C. E. Larson and N. V. Cleemput, Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited, Artificial Intelligence, vol.231, pp.17-38, 2016.
DOI : 10.1016/j.artint.2015.10.002

J. L. Laurière, Constraint propagation or automatic programming, Tech. Rep, vol.19, 1996.

D. B. Lenat, On automated scientific theory formation: a case study using the AM program, Machine intelligence 9, pp.251-286, 1979.

J. Menana, Automata and Constraint Programming for Personnel Scheduling Problems. Theses, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00785838

J. Menana and S. Demassey, Sequencing and Counting with the multicost-regular Constraint, 6th International Conference Proceedings. pp, pp.178-192, 2009.
DOI : 10.1007/978-3-642-82118-9
URL : https://hal.archives-ouvertes.fr/hal-00394434

A. Newell and H. A. Simon, The logic theory machine--A complex information processing system, IEEE Transactions on Information Theory, vol.2, issue.3, pp.61-79, 1956.
DOI : 10.1109/TIT.1956.1056797

L. C. Paulson, The foundation of a generic theorem prover, Journal of Automated Reasoning, vol.49, issue.3, pp.363-397, 1989.
DOI : 10.1007/BF00248324