G. Ramalingam
Theoretical Computer Science
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.
G. Ramalingam
Theoretical Computer Science
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering