Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
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.
Hendrik F. Hamann
InterPACK 2013
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Oliver Bodemer
IBM J. Res. Dev
Liqun Chen, Matthias Enzmann, et al.
FC 2005