Searching for "The Implication Problem for Functional and Inclusion Dependencies" – sorted by Relevance.
-
On Verifying Consistency of XML Specifications
- for functional and inclusion dependencies can be reduced to it [14]. However, this implication problem is known
- Cited by 27 (7 self) – Add To MetaCart
-
On Verifying Consistency of XML Speci
- for functional and inclusion dependencies can be reduced to it [14]. However, this implication problem is known
- Cited by 2 (1 self) – Add To MetaCart
-
Mining Multi-Relational Data
- problem of functional and inclusion dependencies is undecidable [Chandra and Vardi, 1985]. Mining Mart
- Add To MetaCart
-
Well-definedness and semantic type-checking in the nested relational calculus and xquery
- for functional and inclusion dependencies, which is known to be undecidable [1, 8]. Let Σ be a set of functional
- Cited by 4 (3 self) – Add To MetaCart

