Recursive decomposition and bounds of the lattice of Moore co-families.

DOI10.1007/s10472-013-9345-yzbMath1311.06003OpenAlexW1963900559MaRDI QIDQ353309

Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud

Publication date: 12 July 2013

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-013-9345-y

zbMATH Keywords

latticesGalois connectionsMoore familiesclosure systemsknowledge spacesMoore co-families

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Structure theory of lattices (06B05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items

Recursive decomposition tree of a Moore co-family and closure algorithm.

Cites Work

• Functional dependencies in relational databases: A lattice point of view
• Latticial structures in data analysis.
• The number of Moore families on \(n=6\)
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• On the number of databases and closure operations
• Rings of sets
• Counting of Moore Families for n=7
• Knowledge Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item