The following pages link to (Q4023862):
Displaying 32 items.
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Inclusion dependencies and their interaction with functional dependencies in SQL (Q730506) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Asymptotic properties of keys and functional dependencies in random databases (Q1389444) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures (Q1800380) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Optimizations in computing the Duquenne-Guigues basis of implications (Q2248528) (← links)
- Functional dependencies are helpful for partial materialization of data cubes (Q2254643) (← links)
- Attribute-incremental construction of the canonical implication basis (Q2385433) (← links)
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. (Q2454050) (← links)
- Some Remarks on Relational Database Schemes Having Few Minimal Keys (Q3223995) (← links)
- BCNF via Attribute Splitting (Q3223999) (← links)
- Discovering functional and inclusion dependencies in relational databases (Q4022902) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- Tableaux for functional dependencies and independencies (Q4610339) (← links)
- Closure via functional dependence simplification (Q4903555) (← links)
- Computing Dependencies Using FCA (Q5054980) (← links)
- On Dependence Logic (Q5249667) (← links)
- Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies (Q5940937) (← links)
- Normal forms and syntactic completeness proofs for functional independencies (Q5958763) (← links)
- Computations with finite closure systems and implications (Q6064021) (← links)
- Controlling entity integrity with key sets (Q6098153) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
- Towards declarative comparabilities: application to functional dependencies (Q6615314) (← links)
