Pages that link to "Item:Q3912077"
From MaRDI portal
The following pages link to An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic (Q3912077):
Displaying 35 items.
- Learning an extension of the class of functional dependencies with queries (Q264983) (← links)
- On improving dependency implication algorithms (Q287258) (← links)
- Characterisations of multivalued dependency implication over undetermined universes (Q439967) (← links)
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries (Q503461) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Minimal bases of temporal attribute implications (Q722104) (← links)
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions (Q744991) (← links)
- When do non-conflict-free multivalued dependency sets appear? (Q794181) (← links)
- Fuzzy inequational logic (Q892182) (← links)
- Numerical constraints on XML data (Q964502) (← links)
- Order dependency in the relational model (Q1069711) (← links)
- A simple characterization of database dependency implication (Q1077946) (← links)
- An algebraic theory of functional and multivalued dependencies in relational databases (Q1096380) (← links)
- Positive Boolean dependencies (Q1100944) (← links)
- Functional dependencies, supervenience, and consequence relations (Q1322439) (← links)
- Functional dependencies among Boolean dependencies (Q1353956) (← links)
- Closure structures parameterized by systems of isotone Galois connections (Q1679638) (← links)
- Exact learning of multivalued dependency formulas (Q1704556) (← links)
- On sets of graded attribute implications with witnessed non-redundancy (Q1750536) (← links)
- Insertion anomalies and the justification for 4NF in relational databases (Q1894246) (← links)
- Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
- Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations (Q2278100) (← links)
- Monoidal functional dependencies (Q2353408) (← links)
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty (Q2446551) (← links)
- Characterising nested database dependencies by fragments of propositional logic (Q2478548) (← links)
- Exact Learning of Multivalued Dependencies (Q2835618) (← links)
- Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices (Q3003408) (← links)
- Foundations for a Fourth Normal Form over SQL-Like Databases (Q3224000) (← links)
- Spoilt for Choice: Full First-Order Hierarchical Decompositions (Q3638288) (← links)
- Logic and linguistics meeting, Stanford, 1987 (Q3818286) (← links)
- Dependencies for an extended object-oriented database model (Q4847153) (← links)
- (Q5028458) (← links)
- Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data (Q5213646) (← links)
- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes (Q5445293) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
