A. Mikhail, S. O. Babin, and . Kuznetsov, Computing Premises of a Minimal Cover of Functional Dependencies is Intractable, Discrete Applied Mathematics, vol.161, issue.6, pp.742-749, 2013.

K. Bazhanov and S. A. Obiedkov, Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis, Concept Lattices and Applications, volume 959 of CEUR Workshop Proceedings, pp.43-57, 2011.

A. Bazin and J. Ganascia, Computing the Duquenne???Guigues basis: an algorithm for choosing the order, International Journal of General Systems, vol.10, issue.8, pp.57-85, 2016.
DOI : 10.1007/978-3-540-78137-0_14

L. Beaudou, A. Mary, and L. Nourine, Algorithms for k-meet-semidistributive lattices, Theoretical Computer Science, vol.658, pp.391-398, 2017.
DOI : 10.1016/j.tcs.2015.10.029
URL : https://hal.archives-ouvertes.fr/hal-01571243

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

G. Birkhoff, Lattice Theory, 1948.
DOI : 10.1090/coll/025

D. Borchmann, A Generalized Next-Closure Algorithm -Enumerating Semilattice Elements from a Generating Set, Concept Lattices and Applications CEUR Workshop Proceedings, pp.9-20, 2012.

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, The core of finite lattices, Discrete Mathematics, vol.88, issue.2-3, pp.133-147, 1991.
DOI : 10.1016/0012-365X(91)90005-M

B. Ganter and K. Reuter, Finding all closed sets: A general approach, Order, vol.2, issue.3, pp.283-290, 1991.
DOI : 10.1007/BF00383449

A. Gély and L. Nourine, About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base, Formal Concept Analysis, pp.306-308, 2006.
DOI : 10.1007/11671404_13

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

P. Janssen and L. Nourine, Minimum implicational basis for ???-semidistributive lattices, Information Processing Letters, vol.99, issue.5, pp.199-202, 2006.
DOI : 10.1016/j.ipl.2006.04.004
URL : https://hal.archives-ouvertes.fr/lirmm-00101743

S. Kuznetsov and S. Obiedkov, Counting Pseudo-intents and #P-completeness, Formal Concept Analysis, pp.306-308, 2006.
DOI : 10.1007/11671404_21

O. Sergei and . Kuznetsov, On the Intractability of Computing the Duquenne- Guigues Basis, Journal of Universal Computer Science, vol.10, issue.8, pp.927-933, 2004.

S. Obiedkov and V. Duquenne, Attribute-incremental construction of the canonical implication basis, Annals of Mathematics and Artificial Intelligence, vol.23, issue.2, pp.77-99, 2007.
DOI : 10.1007/978-3-642-59830-2

G. Stumme, Attribute Exploration with Background Implications and Exceptions. In Data analysis and information systems, pp.457-469, 1996.
DOI : 10.1007/978-3-642-80098-6_39

M. Wild, Computations with finite closure systems and implications, International Computing and Combinatorics Conference, pp.111-120, 1995.
DOI : 10.1007/BFb0030825

M. Wild, Optimal implicational bases for finite modular lattices, Quaestiones Mathematicae, vol.23, issue.2, pp.153-161, 2000.
DOI : 10.2989/16073600009485964