Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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.
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007