论文信息 - The dependence Graph of a Lattice

The dependence Graph of a Lattice

In this paper, we introduce the dependence graph of a lattice defined on the set of its join-irreducible elements. This graph, issued from the dependence relation on a lattice, is a nice structure encoding together the min- imal generators and the canonical direct basis of a lattice. Then, we propose a new generation algorithm.

Karell Bertet | K. Bertet

[1] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .

[2] Karell Bertet,et al. The multiple facets of the canonical direct unit implicational basis , 2010, Theor. Comput. Sci..

[3] Toshihide Ibaraki,et al. Functional Dependencies in Horn Theories , 1999, Artif. Intell..

[4] Yves Bastide,et al. Computing Proper Implications , 2001 .

[5] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[6] J. Bordat. Calcul pratique du treillis de Galois d'une correspondance , 1986 .

[7] Eugene L. Lawler,et al. Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[8] L. Santocanale,et al. Free μ-lattices , 2000 .

[9] James B. Nation,et al. An approach to lattice varieties of finite height , 1990 .

[10] David Maier,et al. The Theory of Relational Databases , 1983 .

[11] Amélie Le Floc,et al. JEN : un algorithme efficace de construction de générateurs pour l'identification des règles d'association , 2003 .