N. Aribi, A. Ouali, Y. Lebbah, and S. Loudni, Equitable conceptual clustering using OWA operator, Advances in Knowledge Discovery and Data Mining -22nd, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01709850

P. Conference, Proceedings, Part III, pp.465-477, 2018.

B. Babaki, T. Guns, and S. Nijssen, Constrained clustering using column generation, Integration of AI and OR Techniques in Constraint Programming -11th International Conference, vol.8451, pp.438-454, 2014.

C. Barnhart, A. M. Cohn, E. L. Johnson, D. Klabjan, G. L. Nemhauser et al., Airline Crew Scheduling, pp.517-560, 2003.

N. Beldiceanu, Pruning for the minimum constraint family and for the number of distinct values constraint family, pp.211-224, 2001.

C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, Filtering algorithms for the nvalueconstraint, Constraints, vol.11, issue.4, pp.271-293, 2006.

C. Carpineto and G. Romano, GALOIS: an order-theoretic approach to conceptual clustering, Machine Learning, Proceedings of the Tenth International Conference, pp.33-40, 1993.

M. Chabert, Constraint Programming Models for Conceptual Clustering: Application to an ERP Configuration Problem, 2018.
URL : https://hal.archives-ouvertes.fr/tel-01963693

M. Chabert and C. Solnon, Constraint programming for multi-criteria conceptual clustering, Principles and Practice of Constraint Programming -23rd International Conference, CP, Proceedings, vol.10416, pp.460-476, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01544239

T. Dao, K. Duong, and C. Vrain, Constrained clustering by constraint programming, Artif. Intell, vol.244, pp.70-94, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01162640

T. Dao, W. Lesaint, and C. Vrain, Clustering conceptuel et relationnel en programmation par contraintes, JFPC 2015, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01151527

J. Davies and F. Bacchus, Solving MAXSAT by solving a sequence of simpler SAT instances, Principles and Practice of Constraint Programming -17th International Conference, vol.6876, pp.225-239, 2011.

K. Duong, Constrained clustering by constraint programming. Theses, Université d'Orléans, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01162640

J. Fages and T. Lapègue, Filtering atmostnvalue with difference constraints: Application to the shift minimisation personnel task scheduling problem, Artif. Intell, vol.212, pp.116-133, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00859169

D. H. Fisher, Knowledge acquisition via incremental conceptual clustering, Mach. Learn, vol.2, issue.2, pp.139-172, 1987.

A. Floch, C. Wolinski, and K. Kuchcinski, Combined scheduling and instruction selection for processors with reconfigurable cell fabric, 21st IEEE International Conference on Application-specific Systems Architectures and Processors, pp.167-174, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00480680

B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations, 1997.

M. Gavanelli, An algorithm for multi-criteria optimization in csps, Proceedings of the 15th European Conference on Artificial Intelligence, ECAI'02, pp.136-140, 2002.

M. Gebser, B. Kaufmann, and T. Schaub, Conflict-driven answer set solving: From theory to practice, Artif. Intell, vol.187, pp.52-89, 2012.

. Gecode, generic constraint development environment, 2005.

T. Guns, Declarative pattern mining using constraint programming, Constraints, vol.20, issue.4, pp.492-493, 2015.

T. Guns, S. Nijssen, and L. D. Raedt, Itemset mining: A constraint programming perspective, Artif. Intell, vol.175, pp.1951-1983, 2011.

T. Guns, S. Nijssen, and L. D. Raedt, k-pattern set mining under constraints, IEEE Trans. Knowl. Data Eng, vol.25, issue.2, pp.402-418, 2013.

M. M. Halldórsson and J. Radhakrishnan, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, Algorithmica, vol.18, issue.1, pp.145-163, 1997.

H. Blindell and G. , Universal Instruction Selection, 2018.

P. Jaccard, Distribution de la flore alpine dans le bassin des Dranses et dans quelques régions voisines. Bulletin de la Société Vaudoise des Sciences Naturelles, vol.37, pp.241-272, 1901.

T. Junttila and P. Kaski, Exact cover via satisfiability: An empirical study, Principles and Practice of Constraint Programming -CP 2010, pp.297-304, 2010.

R. M. Karp, Reducibility among Combinatorial Problems, pp.85-103, 1972.

P. Kaski and O. Pottonen, libexact user s guide, version 1.0. HIIT Technical Reports, p.187, 2008.

M. Khiari, P. Boizumault, and B. Crémilleux, Constraint programming for mining n-ary patterns, Principles and Practice of Constraint Programming -CP 2010 -16th International Conference, CP 2010, pp.552-567, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01016652

D. E. Knuth, Dancing links. Millenial Perspectives in Computer Science, vol.18, p.4, 2000.

N. Lazaar, Y. Lebbah, S. Loudni, M. Maamar, V. Lemière et al., A global constraint for closed frequent pattern mining, Principles and Practice of Constraint Programming -22nd International Conference, pp.333-349, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01374719

R. S. Michalski and R. E. Stepp, Learning from Observation: Conceptual Clustering, pp.331-363, 1983.

A. Mingozzi, M. A. Boschetti, S. Ricciardelli, and L. Bianco, A set partitioning approach to the crew scheduling problem, Operations Research, vol.47, issue.6, pp.873-888, 1999.

A. Ouali, S. Loudni, Y. Lebbah, P. Boizumault, A. Zimmermann et al., Efficiently finding conceptual clustering models with integer linear programming, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pp.647-654, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01597804

F. Pachet and P. Roy, Principles and Practice of Constraint Programming -CP'99, pp.331-345, 1999.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering frequent closed itemsets for association rules, Database Theory -ICDT '99, 7th International Conference, pp.398-416, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00467747

C. Prud'homme, J. Fages, and X. Lorca, , 2016.

L. D. Raedt, T. Guns, and S. Nijssen, Constraint programming for itemset mining, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.204-212, 2008.

M. S. Rasmussen, Optimisation-Based Solution Methods for Set Partitioning Models, 2011.

F. Rossi, P. V. Beek, and T. Walsh, Handbook of Constraint Programming (Foundations of Artificial Intelligence), 2006.

E. Rnnberg and T. Larsson, All-integer column generation for set partitioning: Basic principles and extensions, European Journal of Operational Research, vol.233, issue.3, pp.529-538, 2014.

P. Schaus, J. O. Aoga, and T. Guns, Coversize: A global constraint for frequencybased itemset mining, Principles and Practice of Constraint Programming, pp.529-546, 2017.

P. Schaus and R. Hartert, Multi-Objective Large Neighborhood Search, pp.611-627, 2013.

W. Ugarte, P. Boizumault, B. Crémilleux, A. Lepailleur, S. Loudni et al., Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems, Artif. Intell, vol.244, pp.48-69, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02048224

T. Uno, T. Asai, Y. Uchida, and H. Arimura, An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases, pp.16-31, 2004.

L. N. Wassenhove and L. F. Gelders, Solving a bicriterion scheduling problem, European Journal of Operational Research, vol.4, issue.1, pp.42-48, 1980.

A. Zaghrouti, F. Soumis, and I. E. Hallaoui, Integral simplex using decomposition for the set partitioning problem, Operations Research, vol.62, issue.2, pp.435-449, 2014.