Pages that link to "Item:Q4294515"
From MaRDI portal
The following pages link to Algorithms for inferring functional dependencies from relations (Q4294515):
Displaying 29 items.
- Improved time complexities for learning Boolean networks (Q280576) (← links)
- Mining approximate interval-based temporal dependencies (Q329410) (← links)
- Characterisations of multivalued dependency implication over undetermined universes (Q439967) (← links)
- RQL: a query language for rule discovery in databases (Q507529) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of inferring functional dependencies (Q1202891) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Inferring minimal functional dependencies in Horn and q-Horn theories (Q1810895) (← links)
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis (Q1870542) (← links)
- Reducing one class of machine learning algorithms to logical operations of plausible reasoning (Q2017512) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- Possibilistic keys (Q2329094) (← links)
- Reasoning about functional and full hierarchical dependencies over partial relations (Q2446453) (← links)
- Non-deterministic ideal operators: an adequate tool for formalization in data bases (Q2478434) (← links)
- Functional and multivalued dependencies in nested databases generated by record and list constructor (Q2502161) (← links)
- Extended dualization: application to maximal pattern mining (Q2634673) (← links)
- Logical Foundations of Possibilistic Keys (Q2938493) (← links)
- Discovering functional and inclusion dependencies in relational databases (Q4022902) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- Relational decomposition through partial functional dependencies (Q4552835) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- (Q4864789) (← links)
- Closure via functional dependence simplification (Q4903555) (← links)
- Technical Correspondence (Q5012536) (← links)
- Using Transversals for Discovering XML Functional Dependencies (Q5445302) (← links)
- Normal forms and syntactic completeness proofs for functional independencies (Q5958763) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation (Q6648284) (← links)