Minimum implicational basis for ∧-semidistributive lattices

Information Processing Letters

Volumn 99, Issue 5, 2006, Pages 199-202

  Janssen, Philippe ^a   Nourine, Lhouari ^b  

^a LIRMM   (France)

^b UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Algorithms; Closure system; Lattice; Minimum implicational basis

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; POLYNOMIALS;

CLOSURE SYSTEMS; LATTICES; MINIMUM IMPLICATIONAL BASIS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33745421527     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.04.004     Document Type: Article

References (15)

1. Caspard N., and Monjardet B. The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey. Discrete Applied Mathematics 127 2 (2003) 241-269
2. Duquenne V. The core of finite lattice. Discrete Mathematics 88 (1991) 133-147
3. Eiter T., and Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24 6 (1995) 1278-1304
4. T. Eiter, G. Gottlob, Hypergraph transversal computation and related problems in logic and AI, in: European Conference on Logics in Artificial Intelligence (JELIA'02), 2002, pp. 549-564
5. Fredman M.L., and Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21 (1996) 618-628
6. Ganter B., and Wille R. Formal Concept Analysis: Mathematical Foundations (1996), Springer-Verlag, Berlin
7. Guigues J.L., and Duquenne V. Families minimales d'implications informatives resultant d'un tableau de donnes binaires. Mathétiques et Sciences humaines 95 (1986) 5-18
8. Freeze R., Jezek K., and Nation J.B. Free Lattices (1995), American Mathematical Society, Providence, RI
9. Janssen P., and Nourine L. A simplicial scheme for meet-semidistributive lattices and interval collapsing. Universalis Algebra 50 2 (2003) 171-178
10. Maier D. The Theory of Relational Data Bases (1983), Computer Science Press, Rockville, MD
11. Nation J.B. Unbounded semidistributive lattices. Algebra and Logic 39 (2000) 87-92
12. L. Nourine, Une structuration algorithmique de la théorie des treillis, Habilitation à diriger des recherches, Université de Montpellier II, France, July 2000
13. Shock R.C. Computing the minimum cover of functional dependencies. Information Processing Letters 22 3 (1986) 157-159
14. Wild M. Optimal implicational bases for finite modular lattices. Quaestiones Mathematicae 23 (2000) 153-161
15. Wille R. Subdirect decomposition of concept lattices. Algebra Universalis 17 (1983) 275-287