R. Wille, Restructuring lattice theory: an approach based on hierarchies of concepts, pp.445-470, 1982.

B. Ganter and R. Wille, Formal concept analysis: Mathematical foundations, 1999.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Efficient mining of association rules using closed itemset lattices, Inform Syst, vol.24, issue.1, pp.25-46, 1999.

J. L. Guigues and V. Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires, Math Sci Hum, vol.95, pp.5-18, 1986.

M. Luxemburger, Implications partielles dans un contexte, Math Sci Hum, vol.113, pp.35-55, 1991.

R. Missaoui, L. Nourine, and Y. Renaud, Generating positive and negative exact rules using formal concept analysis: problems and solutions, Proc 6th Int Conf on Formal Concept Analysis, pp.169-181, 2008.

R. Missaoui, L. Nourine, and Y. Renaud, Computing implications with negation from a formal context, Fundam Inform, vol.115, issue.4, pp.357-375, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01352937

G. Gargov, S. Passy, and T. Tinchev, Modal environment for Boolean speculation, pp.253-263, 1987.

I. Düntsch and E. Orlowska, Mixing modal and sufficiency operators, Polish Acad Sci, vol.28, issue.2, pp.99-106, 1999.

I. Düntsch and E. Orlowska, Beyond modalities: sufficiency and mixed algebras, Relational methods for computer sciences applications, pp.263-285, 2001.

B. Jónsson and A. Tarski, Boolean algebras with operators i, Am J Math, vol.73, pp.891-939, 1951.

I. Düntsch, G. Gediga, H. De-swart, E. Or?owska, G. Schmidt et al., Approximation operators in qualitative data analysis, Theory and application of relational structures as knowledge instruments, vol.2929, pp.214-230, 2003.

I. Düntsch and G. Gediga, Modal-style operators in qualitative data analysis, Proc 2002 IEEE Int Conf on Data Mining (ICDM'02)

J. Maebashi, , pp.155-162, 2002.

Y. Yao and Y. Chen, Rough set approximations in formal concept analysis, Transactions on rough sets V, vol.4100, pp.285-305, 2006.

D. Dubois, F. Dupin-de-saint-cyr, and H. Prade, A possibility-theoretic view of formal concept analysis, Fundam Inform, vol.75, issue.1-4, pp.195-213, 2007.

D. Dubois and H. Prade, Possibility theory and formal concept analysis in information systems, Proc Int Fuzzy Systems Association World Congress (IFSA'09), pp.1021-1026, 2009.

Y. Djouadi and H. Prade, Possibility-theoretic extension of derivation operators in formal concept analysis over fuzzy lattices, Fuzzy Optim Decis Making, vol.10, issue.1-4, pp.287-309, 2011.

P. Burmeister and R. Holzer, Treating incomplete knowledge in formal concept analysis, Formal concept analysis, pp.114-126, 2005.

S. A. Obiedkov, Modal logic for evaluating formulas in incomplete contexts, Conceptual structures: integration and interfaces, vol.2393, pp.314-325, 2002.

Z. Ait-yakoub, Y. Djouadi, D. Dubois, and H. Prade, From a possibility theory view of formal concept analysis to the possibilistic handling of incomplete and uncertain contexts, CEUR Proc. Workshop FCA for AI, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01445243

D. Dubois and H. Prade, Possibility theory, 1988.
URL : https://hal.archives-ouvertes.fr/hal-01136336

D. Dubois and H. Prade, An overview of the asymmetric bipolar representation of positive and negative information in possibility theory, Fuzzy Sets Syst, vol.160, issue.10, pp.1355-1366, 2009.

D. Dubois and H. Prade, Formal concept analysis from the standpoint of possibility theory, Proc 13th Int Conf (ICFCA 2015), vol.9113, pp.21-38, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01291629

Y. Djouadi, D. Dubois, H. Prade, and . Graduality, 35 years of fuzzy set theory-Celebratory volume dedicated to the retirement of Etienne E. Kerre, pp.127-147, 2011.

F. Baader, D. Calvanese, D. Mcguinness, D. Nardi, and P. F. Patel-schneider, The description logic handbook: Theory, implementation, and applications, 2003.

S. Rudolph, Exploring relational structures via FLE, Conceptual structures at work. 12th Int Conf on Conceptual Structures, vol.3127, pp.196-212, 2004.

A. Bazin and J. Ganascia, Completing terminological axioms with formal concept analysis, Int Conf on Formal Concept Analysis (ICFCA); Leuven; Belgium, pp.30-39, 2012.

Z. Ait-yakoub and Y. Djouadi, Generating GCIs axioms from objects descriptions in ELdescription logics, Modeling approaches and algorithms for advanced computer applications (CIIA 2013), vol.488, pp.75-84, 2013.

G. Qi, J. Pan, Z. , J. Q. Calvanese, D. Franconi et al., A possibilistic extension of description logics, CEUR Workshop Proceedings. CEUR-WS, vol.250, pp.435-442, 2007.

F. Baader, B. Ganter, U. Sattler, and B. Sertkaya, Completing description logic knowledge bases using formal concept analysis, 2006.

F. Baader, Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology, Proc Int Sym on Knowledge Retrieval, Use, and Storage for Efficiency (KRUSE 95), pp.168-178, 1995.

F. Baader and B. Sertkaya, Applying formal concept analysis to description logics, Proc 2nd Int Conf on Formal Concept Analysis (ICFCA), vol.2961, pp.261-286, 2004.

B. Ganter, Attribute exploration with background knowledge, Theor Comput Sci, vol.217, issue.2, pp.215-233, 1999.

F. Baader and F. Distel, Exploring finite models in the description logic ELgfp, Proc 7th Int Conf on Formal Concept Analysis (ICFCA), vol.5548, pp.146-161, 2009.