K. Bertet and N. Caspard, Doubling convex sets in lattices: characterizations and recognition algorithms. Order, pp.181-207, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00095564

]. G. Bir67 and . Birkhoff, Lattice theory, 1967.

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

R. [. Cousot and . Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

B. [. Caspard and . Monjardet, Some lattices of closure systems on a finite set, Discrete Mathematics and Theoretical Computer Sciences, vol.6, pp.163-190, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00959003

G. Filé, R. Giacobazzi, and F. Ranzato, A unifying view of abstract domain design, ACM Computing Surveys, vol.28, issue.2, pp.333-336, 1996.
DOI : 10.1145/234528.234742

]. B. Gan84 and . Ganter, Two basic algorithms in concept lattices, 1984.

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

F. [. Giacobazzi and . Ranzato, A logical model for relational abstract domains, ACM Transactions on Programming Languages and Systems, vol.20, issue.5, pp.1067-1109, 1998.
DOI : 10.1145/293677.293680

F. [. Giacobazzi, F. Ranzato, and . Scozzari, Making abstract interpretations complete, Journal of the ACM, vol.47, issue.2, pp.361-416, 2000.
DOI : 10.1145/333979.333989
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.2353

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

M. Habib and L. Nourine, Tree structure for distributive lattices and its applications, Theoretical Computer Science, vol.165, issue.2, pp.391-405, 1996.
DOI : 10.1016/0304-3975(95)00232-4

D. Maier, The Theory of Relational Databases, 1983.

M. Morvan and L. Nourine, Simplicial elimination scheme, extremal lattices and maximal antichains lattices. Order, pp.159-173, 1996.

J. Morgado, Note on the distributive closure operators by means of one axiom, Portugal Maths, vol.23, pp.11-25, 1964.

H. Mannila and K. J. Räihä, The design of relational databases Nourine and O. Raynaud. A fast algorithm for building lattices, Third International Conference on Orders, Algorithms and Applications, 1992.

Y. [. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Discovering Frequent Closed Itemsets for Association Rules, ICDT'99, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

]. R. Wil83 and . Wille, Subdirect decomposition of concepts lattices, Algebra Universalis, vol.17, pp.275-287, 1983.

M. Wild, A Theory of Finite Closure Spaces Based on Implications, Advances in Mathematics, vol.108, issue.1, pp.118-139, 1994.
DOI : 10.1006/aima.1994.1069

M. Wild, Computations with finite closure systems and implications, Proceedings of the 1st Annual International Conference on Computing and Combinatorics (COCOON'95), pp.111-120, 1995.
DOI : 10.1007/BFb0030825