Qing Li, Zhigang Deng, et al.
IEEE T-MI
The implication problem for a class of dependencies is the following: given a finite set of dependencies, determine if they logically imply another dependency. The authors showed that the implication problem is undecidable for the class of functional and inclusion dependencies. This holds true even if the inclusion dependencies are restricted to be binary. It may be noted that the implication problem is known to be decidable for functional and unary inclusion dependencies and also for inclusion dependencies without functional dependencies.
Qing Li, Zhigang Deng, et al.
IEEE T-MI
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics