R. Agrawal, T. Imieli´nskiimieli´nski, and A. Swami, Mining association rules between sets of items in large databases, Acm sigmod record, vol.22, pp.207-216
DOI : 10.1145/170035.170072

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, Mining minimal non-redundant association rules using frequent closed itemsets, Computational Logic, pp.972-986, 2000.
DOI : 10.1007/3-540-44957-4_65

URL : https://hal.archives-ouvertes.fr/hal-00467751

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Mining frequent patterns with counting inference, SIGKDD Explorations, vol.2, pp.66-75, 2000.
DOI : 10.1145/380995.381017

URL : https://hal.archives-ouvertes.fr/hal-00467750

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The complexity of reasoning with global constraints, Constraints, vol.12, issue.2, pp.239-259, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00195881

A. Boudane, S. Jabbour, L. Sais, and Y. Salhi, A satbased approach for mining association rules, IJCAI, pp.2472-2478, 2016.

A. Boudane, S. Jabbour, L. Sais, and Y. Salhi, Enumerating non-redundant association rules using satisfiability, PAKDD, pp.824-836, 2017.
DOI : 10.1007/978-3-319-57454-7_64

L. De-raedt, T. Guns, and S. Nijssen, Constraint programming for itemset mining, KDD, pp.204-212, 2008.

M. Kryszkiewicz, Representative association rules, PAKDD, pp.198-209, 1998.
DOI : 10.1007/3-540-64383-4_17

M. Kryszkiewicz, Representative association rules and minimum condition maximum consequence association rules, pp.361-369, 1998.
DOI : 10.1007/bfb0094839

URL : https://link.springer.com/content/pdf/10.1007%2FBFb0094839.pdf

N. Lazaar, Y. Lebbah, S. Loudni, M. Maamar, V. Lemì-ere et al., A global constraint for closed frequent pattern mining, CP, pp.333-349, 2016.
DOI : 10.1007/978-3-319-44953-1_22

URL : https://hal.archives-ouvertes.fr/lirmm-01374719

D. Nguyen, B. Vo, and . Kse, Knowledge and Systems Engineering, pp.307-318, 2013.

F. Rossi, P. Van-beek, and T. Walsh, Handbook of constraint programming, 2006.

P. Schaus, J. O. Aoga, and T. Guns, Coversize: A global constraint for frequency-based itemset mining, CP, pp.529-546, 2017.

L. Szathmary, A. Napoli, and S. O. Kuznetsov, Zart: A multifunctional itemset mining algorithm, CLA, pp.26-37, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00001271

L. Szathmary, P. Valtchev, A. Napoli, and R. Godin, An efficient hybrid algorithm for mining frequent closures and generators, CLA, pp.47-58, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00335247

M. Wojciechowski and M. Zakrzewicz, Dataset filtering techniques in constraint-based frequent pattern mining. Pattern detection and discovery, pp.301-318, 2002.