Computations with finite closure systems and implications

DOI10.1007/bfb0030825zbMath1527.68148MaRDI QIDQ6064021

Marcel Wild

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Database theory (68P15) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (3)

Three views on dependency covers from an FCA perspective ⋮ On the Merge of Factor Canonical Bases ⋮ Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the minimum cover of functional dependencies
• Finding all closed sets: A general approach
• Concept lattices and conceptual knowledge systems
• Cover-preserving order embeddings into Boolean lattices
• A theory of finite closure spaces based on implications
• Efficient subsemilattice generation
• A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY

This page was built for publication: Computations with finite closure systems and implications