G. Arévalo, A. Berry, M. Huchard, G. Perrot, and A. Sigayret, Performances of Galois Sub-hierarchy-building Algorithms, ICFCA, pp.166-180, 2007.
DOI : 10.1007/978-3-540-70901-5_11

M. Barbut and B. Monjardet, Ordre et classification ? Algèbre et combinatoire, 1970.

A. Berry, J. P. Bordat, and A. Sigayret, A local approach to concept generation, Annals of Mathematics and Artificial Intelligence, vol.256, issue.3, pp.117-136, 2007.
DOI : 10.1007/s10472-007-9063-4

A. Berry, M. Huchard, R. M. Mcconnell, A. Sigayret, and J. P. Spinrad, Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice, Lecture Notes in Computer Science, vol.3403, pp.208-222, 2005.
DOI : 10.1007/978-3-540-32262-7_14
URL : https://hal.archives-ouvertes.fr/lirmm-00106459

A. Berry and A. Sigayret, Maintaining Class Membership Information, OOIS Workshops, pp.13-23, 2002.
DOI : 10.1007/3-540-46105-1_3
URL : https://hal.archives-ouvertes.fr/hal-00522346

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.1-6, 1987.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

H. Dicky, C. Dony, M. Huchard, and T. Libourel, Ares, un algorithme d'ajout avec restructuration dans les hiérarchies de classes, Proc. of LMO'94, pp.125-136, 1994.

H. Dicky, C. Dony, M. Huchard, T. Libourel, and . Ares, Adding a class and REStructuring Inheritance Hierarchies, Proc. of BDA'95, pp.25-42, 1995.

H. Dicky, C. Dony, M. Huchard, and T. Libourel, On automatic class insertion with overloading, OOP- SLA, pp.251-267, 1996.

X. Dolques, F. L. Ber, and M. Huchard, AOC-Posets: a Scalable Alternative to Concept Lattices for Relational Concept Analysis, Proc. of the Tenth International Conference on Concept Lattices and Their Applications, pp.129-140, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00916850

D. Dubois, F. Dupin-de-saint-cyr-bannay, and H. Prade, A possibiltytheoretic view of formal concept analysis, Fundamenta Informaticae, vol.75, issue.1-4, pp.195-213, 2007.

D. Dubois and H. Prade, From Blanch?????s Hexagonal Organization of Concepts to Formal Concept Analysis and Possibility Theory, Logica Universalis, vol.1, issue.2, pp.149-169, 2012.
DOI : 10.1007/s11787-011-0039-0

E. M. Eschen, N. Pinet, and A. Sigayret, Consecutive-ones: handling lattice planarity efficiently, Proc. of CLA 2007 (Concept Lattices and Applications), CEUR WS, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00522407

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

R. Godin and H. Mili, Building and Maintaining Analysis-Level Class Hierarchies using Galois Lattices, Proc. of OOPSLA '93, pp.394-410, 1993.
DOI : 10.1145/167962.165931
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.4242

P. Hitzler, Default Reasoning over Domains and Concept Hierarchies, Proc. of KI, pp.351-365, 2004.
DOI : 10.1007/978-3-540-30221-6_27
URL : http://arxiv.org/abs/cs/0409002

W. Hsu and T. Ma, Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs, SIAM Journal on Computing, vol.28, issue.3, pp.1004-1020, 1999.
DOI : 10.1137/S0097539792224814
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.4647

M. Huchard, H. Dicky, and H. Leblanc, Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms, Theoretical Informatics and Applications, pp.521-548, 2000.
DOI : 10.1051/ita:2000129

H. Leblanc, Sous-hiérarchies de Galois: un Modèle pour la Construction et L'´ evolution des Hiérarchies d'objets (in french), 2000.

F. Loesch and E. Ploedereder, Restructuring Variability in Software Product Lines using Concept Analysis of Product Configurations, 11th European Conference on Software Maintenance and Reengineering (CSMR'07), pp.159-170, 2007.
DOI : 10.1109/CSMR.2007.40

A. Lubiw, Doubly Lexical Orderings of Matrices, SIAM Journal on Computing, vol.16, issue.5, pp.854-879, 1987.
DOI : 10.1137/0216057

W. M. Guy, R. Gecsei, and . Godin, Structuring knowledge bases using automatic learning, ICDE, pp.274-280, 1990.

R. Osswald and W. Petersen, Induction of classifications from linguistic data, Proc. of ECAI'02 Workshop on Advances in Formal Concept Analysis for Knowledge Discovery in Databases, 2002.

R. Osswald and W. Petersen, A Logical Approach to Data-Driven Classification, Proceedings of the 26th Annual German Conference on Advances in Artificial Intelligence, pp.267-281, 2003.
DOI : 10.1007/978-3-540-39451-8_20

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

W. Petersen, A Set-Theoretical Approach for the Induction of Inheritance Hierarchies, Proceedings of the Joint Conference on Formal Grammar and Mathematics of Language Electronic Notes in Theoretical in Computer Science, pp.296-308, 2001.
DOI : 10.1016/S1571-0661(05)82590-3

M. Rouane-hacene, M. Huchard, A. Napoli, and P. Valtchev, Relational concept analysis: mining concept lattices from multi-relational data, Annals of Mathematics and Artificial Intelligence, vol.5, issue.1, pp.81-108, 2013.
DOI : 10.1007/s10472-012-9329-3
URL : https://hal.archives-ouvertes.fr/lirmm-00816300

U. Ryssel, J. Ploennigs, and K. Kabitzsch, Extraction of feature models from formal contexts, Proceedings of the 15th International Software Product Line Conference on, SPLC '11, p.4, 2011.
DOI : 10.1145/2019136.2019141

A. Sigayret, Data mining: une approche par les graphes (in french), 2002.

J. P. Spinrad, Doubly lexical ordering of dense 0???1 matrices, Information Processing Letters, vol.45, issue.5, pp.229-235, 1993.
DOI : 10.1016/0020-0190(93)90209-R

J. P. Spinrad, Efficient Graph Representations, 2003.
DOI : 10.1090/fim/019

Y. Xue, Z. Xing, and S. Jarzabek, Feature Location in a Collection of Product Variants, 2012 19th Working Conference on Reverse Engineering, pp.145-154, 2012.
DOI : 10.1109/WCRE.2012.24

Y. Yang, X. Peng, and W. Zhao, Domain Feature Model Recovery from Multiple Applications Using Data Access Semantics and Formal Concept Analysis, 2009 16th Working Conference on Reverse Engineering, pp.215-224, 2009.
DOI : 10.1109/WCRE.2009.15

Y. Yao, A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis, Rough Sets and Current Trends in Computing, pp.59-68, 2004.
DOI : 10.1007/978-3-540-25929-9_6

A. Serhiy and . Yevtushenko, System of data analysis Concept Explorer, Proc. of the 7th national conference on Artificial Intelligence KII-2000, Russia, pp.127-134, 2000.