Pages that link to "Item:Q3919121"
From MaRDI portal
The following pages link to Minimum Covers in Relational Database Model (Q3919121):
Displayed 33 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- Succinctness in dependency systems (Q593796) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- On implicational bases of closure systems with unique critical sets. (Q741717) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Deciding implication for functional dependencies in complex-value databases (Q860838) (← links)
- Propagating XML constraints to relations (Q878752) (← links)
- The synthesis approach for relational database design: An expanded perspective (Q918695) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Synthesis of unnormalized relations incorporating more meaning (Q1062474) (← links)
- Computing the minimum cover of functional dependencies (Q1072723) (← links)
- On the size of nonredundant FD-covers (Q1108065) (← links)
- A note on relation schemes which are in 3NF but not in BCNF (Q1334627) (← links)
- Generating a condensed representation for association rules (Q1774512) (← links)
- Directed hypergraphs and applications (Q1803674) (← links)
- On the relationship of minimum and optimum covers for a set of functional dependencies (Q1836314) (← links)
- Fuzzy functional dependencies and independencies in extended fuzzy relational database models (Q1914453) (← links)
- Some results about normal forms for functional dependency in the relational datamodel (Q1923601) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets (Q2369012) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Functional and multivalued dependencies in nested databases generated by record and list constructor (Q2502161) (← links)
- Structure of closures in relational schemas with join and functional dependencies (Q4007427) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory (Q5445294) (← links)