Pages that link to "Item:Q579962"
From MaRDI portal
The following pages link to Design by example: An application of Armstrong relations (Q579962):
Displaying 31 items.
- Characterisations of multivalued dependency implication over undetermined universes (Q439967) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- Functional dependencies in relational databases: A lattice point of view (Q1202888) (← links)
- On the complexity of inferring functional dependencies (Q1202891) (← links)
- The number of keys in relational and nested relational databases (Q1202895) (← links)
- Direct product decompositions of lattices, closures and relation schemes (Q1210557) (← links)
- Axiomatisation of functional dependencies in incomplete relations (Q1274978) (← links)
- Reasoning with examples: Propositional formulae and database dependencies (Q1306568) (← links)
- Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel (Q1309754) (← links)
- Family of functional dependencies and its equivalent descriptions (Q1346836) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Automatic generation of test data for relational queries (Q1823740) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Some results about normal forms for functional dependency in the relational datamodel (Q1923601) (← links)
- The implication problem for functional dependencies and variants of marginal distribution equivalences (Q2103913) (← links)
- Constructing Armstrong tables for general cardinality constraints and not-null constraints (Q2254637) (← links)
- Maximal sensitivity of Boolean nested canalizing functions (Q2272408) (← links)
- Possibilistic keys (Q2329094) (← links)
- Reasoning about functional and full hierarchical dependencies over partial relations (Q2446453) (← links)
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty (Q2446551) (← links)
- Reasoning with models (Q2676579) (← links)
- Logical Foundations of Possibilistic Keys (Q2938493) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- The implication problem for functional dependencies and variants of marginal distribution equivalences (Q6636619) (← links)
