K. V. Adaricheva and J. B. Nation, On implicational bases of closure systems with unique critical sets, Discrete Applied Mathematics, vol.162, pp.51-69, 2014.
DOI : 10.1016/j.dam.2013.08.033

K. V. Adaricheva and J. B. Nation, Discovery of the D-basis in binary tables based on hypergraph dualization, Theoretical Computer Science, vol.658, 2015.
DOI : 10.1016/j.tcs.2015.11.031

K. V. Adaricheva, J. B. Nation, and R. Rand, Ordered direct implicational basis of a nite closure system, Discrete Applied Mathematics, vol.161, issue.6, p.707723, 2013.

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, p.307328, 1996.

M. A. Babin and S. O. Kuznetsov, Computing premises of a minimal cover of functional dependencies is intractable, Discrete Applied Mathematics, vol.161, issue.6, pp.742-749, 2013.
DOI : 10.1016/j.dam.2012.10.026

M. Barbut and B. Monjardet, Ordre et classication, 1970.

C. Beeri, M. Dowd, R. Fagin, and R. Statman, On the Structure of Armstrong Relations for Functional Dependencies, Journal of the ACM, vol.31, issue.1, p.3046, 1984.
DOI : 10.1145/2422.322414

K. Bertet and B. Monjardet, The multiple facets of the canonical direct unit implicational basis, Theoretical Computer Science, vol.411, issue.22-24, pp.22-2421552166, 2010.
DOI : 10.1016/j.tcs.2009.12.021
URL : https://hal.archives-ouvertes.fr/halshs-00308798

G. Birkho, Lattices theory, American Mathematical Soc, 1940.

E. Boros, V. Gurvich, L. Khachiyan, and K. Makino, Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph, SIAM Journal on Computing, vol.30, issue.6
DOI : 10.1137/S0097539700370072

E. Boros, V. Gurvich, L. Khachiyan, and K. Makino, Generating weighted transversals of a hypergraph, RUTGERS UNIVERSITY, p.1322, 2000.

A. Day, J. B. Nation, and S. Tschantz, Doubling convex sets in lattices and a generalized semidistributivity condition, Order, vol.269, issue.2, p.175180, 1989.
DOI : 10.2140/pjm.1979.82.463

F. Distel and B. Sertkaya, On the complexity of enumerating pseudo-intents, Discrete Applied Mathematics, vol.159, issue.6, pp.450-466, 2011.
DOI : 10.1016/j.dam.2010.12.004

V. Duquenne, Conception de plans d'experiences ou d'enquetes permutables distributifs, Math. Sci. hum, vol.100, p.81107, 1987.

T. Eiter and G. Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems, SIAM Journal on Computing, vol.24, issue.6, p.12781304, 1995.
DOI : 10.1137/S0097539793250299

T. Eiter, G. Gottlob, and K. Makino, New results on monotone dualization and generating hypergraph transversals, SIAM J. Comput, vol.32, issue.2, p.514537, 2003.
DOI : 10.1145/509907.509912
URL : http://arxiv.org/abs/cs/0204009

M. L. Fredman and L. Khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms, Journal of Algorithms, vol.21, issue.3, p.618628, 1996.
DOI : 10.1006/jagm.1996.0062

B. Ganter and R. Wille, Formal concept analysis -mathematical foundations, 1999.

W. Geyer, Generalizing semidistributivity. Order, p.7792, 1993.
DOI : 10.1007/bf01108710

D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, Data mining, hypergraph transversals, and machine learning, PODS, pp.209-216, 1997.
DOI : 10.1145/263661.263684
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1843

V. A. Gurvich, On theory of multistep games, USSR Computational Mathematics and Mathematical Physics, vol.13, issue.6, pp.143-161, 1973.
DOI : 10.1016/0041-5553(73)90011-6

M. Habib and L. Nourine, The number of moore families on =6, Discrete Mathematics, vol.294, issue.3, p.291296, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00105351

M. Habib and L. Nourine, A representation theorem for lattices via set-colored posets

P. Janssen and L. Nourine, A simplicial elimination scheme for meetsemidistributive lattices and interval collapsing. Algebra Universalis, 2003.
DOI : 10.1007/s00012-003-1833-1
URL : https://hal.archives-ouvertes.fr/lirmm-00269794

P. Janssen and L. Nourine, Minimum implicational basis for meetsemidistributive lattices, IPL, vol.99, issue.5, 2006.
DOI : 10.1016/j.ipl.2006.04.004
URL : https://hal-lirmm.ccsd.cnrs.fr/lirmm-00101743/document

D. J. Kavvadias, M. Sideri, and E. C. Stavropoulos, Generating all maximal models of a Boolean expression, Information Processing Letters, vol.74, issue.3-4, pp.3-4157, 2000.
DOI : 10.1016/S0020-0190(00)00023-5

H. Mannila and K. Raihä, Design by example: An application of Armstrong relations, Journal of Computer and System Sciences, vol.33, issue.2, pp.126-141, 1986.
DOI : 10.1016/0022-0000(86)90015-2

G. Markowsky, Combinatorial aspects of lattice theory with applications to the enumeration of free distributive lattices, 1973.

G. Markowsky, Some combinatorial aspects of lattice theory, Proc. Univ. of Houston, p.3668, 1973.

L. Nourine, Colored posets and upper locally distributive lattices, 2000.

L. Nourine, Une Structuration Algorithmique de la Théorie des Treillis . Habilitation à diriger des recherches, 2000.

L. Nourine and J. Petit, Extending set-based dualization: Application to pattern mining, ECAI 2012, p.630635, 2012.
DOI : 10.1016/j.tcs.2016.01.020
URL : https://hal.archives-ouvertes.fr/hal-01353000

K. G. Ramamurthy, Coherent Structures and Simple Games Theory and decision library, Game theory, mathematical programming, and operations research: Series C, 1990.

U. Ryssel, F. Distel, and D. Borchmann, Fast algorithms for implication bases and attribute exploration using proper premises, Annals of Mathematics and Artificial Intelligence, vol.21, issue.4, p.2553, 2014.
DOI : 10.1137/060653032

R. C. Shock, Computing the minimum cover of functional dependencies, Information Processing Letters, vol.22, issue.3
DOI : 10.1016/0020-0190(86)90063-3

M. Wild, The joy of implications, aka pure Horn formulas: Mainly a survey, Theoretical Computer Science, vol.658
DOI : 10.1016/j.tcs.2016.03.018

M. Wild, Computations with nite closure systems and implications, Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China Proceedings, p.111120, 1995.
DOI : 10.1007/bfb0030825

M. Wild, Optimal implicational bases for nite modular lattices, Quaestiones Mathematicae, vol.23, issue.2, p.153161, 2000.
DOI : 10.2989/16073600009485964

R. Wille, Subdirect decomposition of concept lattices, Algebra Universalis, vol.17, issue.1, p.275287, 1983.
DOI : 10.1007/bf01194537