Computations with finite closure systems and implications
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303202
- A complexity theory for feasible closure properties
- On computable aspects of algebraic and definable closure
- Closed sets and operators thereon: representations, computability and complexity
- Computing congruent closures on terms
- scientific article; zbMATH DE number 5251909
- On the complexity of the integral closure
- Efficient computation of transitive closures
- Computability of algebraic and definable closure
- scientific article; zbMATH DE number 15249
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 49099 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
- A theory of finite closure spaces based on implications
- Computing the minimum cover of functional dependencies
- Concept lattices and conceptual knowledge systems
- Cover-preserving order embeddings into Boolean lattices
- Efficient subsemilattice generation
- Finding all closed sets: A general approach
Cited in
(8)- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
- Three views on dependency covers from an FCA perspective
- Computing congruent closures on terms
- Towards declarative comparabilities: application to functional dependencies
- On the Merge of Factor Canonical Bases
- Efficient realizations of closure systems
- A minimal base or a direct base? That is the question!
- Systematization of a set of closure techniques
This page was built for publication: Computations with finite closure systems and implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064021)
