The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey, Discrete Applied Mathematics, vol.127, issue.2, pp.241-269, 2003. ,
DOI : 10.1016/S0166-218X(02)00209-3
URL : https://hal.archives-ouvertes.fr/hal-00095569
The core of finite lattices, Discrete Mathematics, vol.88, issue.2-3, pp.133-147, 1991. ,
DOI : 10.1016/0012-365X(91)90005-M
Identifying the Minimal Transversals of a Hypergraph and Related Problems, SIAM Journal on Computing, vol.24, issue.6, pp.1278-1304, 1995. ,
DOI : 10.1137/S0097539793250299
Hypergraph Transversal Computation and Related Problems in Logic and AI, European Conference on Logics in Artificial Intelligence (JELIA'02), pp.549-564, 2002. ,
DOI : 10.1007/3-540-45757-7_53
On the Complexity of Dualization of Monotone Disjunctive Normal Forms, Journal of Algorithms, vol.21, issue.3, pp.618-628, 1996. ,
DOI : 10.1006/jagm.1996.0062
Formal Concept Analysis: Mathematical Foundations, 1996. ,
Families minimales d'implications informatives resultant d'un tableau de donnes binaires, Mathétiques et Sciences humaines, vol.95, pp.5-18, 1986. ,
A Simplicial elimination scheme for ?-semidistributive lattices and interval collapsing, Algebra Universalis, vol.50, issue.2, pp.171-178, 2003. ,
DOI : 10.1007/s00012-003-1833-1
URL : https://hal.archives-ouvertes.fr/lirmm-00269794
The Theory of Relational Data Bases, 1983. ,
Une structuration algorithmique de la théorie des treillis, Habilitation à diriger des recherches, 2000. ,
Computing the minimum cover of functional dependencies, Information Processing Letters, vol.22, issue.3, pp.157-159, 1986. ,
DOI : 10.1016/0020-0190(86)90063-3
Optimal implicational bases for finite modular lattices, Quaestiones Mathematicae, vol.23, issue.2, pp.153-161, 2000. ,
DOI : 10.2989/16073600009485964
Subdirect decomposition of concept lattices, Algebra Universalis, vol.283, issue.284, pp.275-287, 1983. ,
DOI : 10.1007/BF01194537