Ideal non-deterministic operators as a formal framework to reduce the key finding problem

References

• Cordero , P. , Enciso , M. , de Guzmán , I. P. and Mora , A. SLFD logic: Elimination of data redundancy in knowledge representation . Advances in Artificial Intelligence - IBERAMIA 2002: 8th Ibero-American Conference on AI, Seville, Spain, November 12–15, 2002, Proceedings . Edited by: Garijo , F. J. , Riquelme Santos , J. C. and Toro , M. Vol. 2527 , pp. 141 – 151 . Berlin : Springer . Lecture Notes in Computer Science
   Google Scholar
• Cordero , P. , Enciso , M. , Mora , A. and de Guzmán , I. P. A complete logic for fuzzy functional dependencies over domains with similarity relations . Bio-Inspired Systems: Computational and Ambient Intelligence, 10th International Work-Conference on Artificial Neural Networks, IWANN 2009, Salamanca, Spain, June 10–12, 2009, Proceedings, Part I 2009 . Edited by: Cabestany , J. , Sandoval , F. , Prieto , A. and Corchado , J. M. Vol. 5517 , pp. 261 – 269 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Cordero , P. , Mora , A. , Enciso , M. and de Guzmán , I. P. Computing minimal keys using lattice theory . 30 June, 1–3 July 2009 , Gijón, Asturias, Spain. Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2009 , pp. 288 – 299 . Vol. 1, J. Vigo Aguiar, ed., J. Vigo Aguiar y B.A. Wade Editores, Gijón – Asturias, Spain
   Google Scholar
• Cordero , P. , Mora , A. , de Guzmán , I. P. and Enciso , M. 2008 . Non-deterministic ideal operators: An adequate tool for formalization in data bases . Discrete Appl. Math. , 156 ( 6 ) : 911 – 923 .
   Web of Science ®Google Scholar
• Cordero , P. , Mora , A. , de Guzmán , I. P. and Enciso , M. 2008 . “ Reasoning about fuzzzy functional dependencies ” . In ESTYLF , Edited by: European Centre for Soft Computing . 911 – 923 . Mieres – Asturias, , Spain : European Centre for Soft Computing .
   Google Scholar
• Cordero , P. , Mora , A. , de Guzmán , I. P. and Enciso , M. 2010 . “ A complete logic for fuzzy functional dependencies over t-norms ” . In ESTYLF , Edited by: Peregrín Rubio , A. , Alcalá Fernandez , J. , Moreno Velo , F. J. and Márquez Fernández , F. A. 210 – 215 . Huelva, , Spain : European Centre for Soft Computing .
   Google Scholar
• Guan , J. W. and Bell , D. A. 1998 . Rough computational methods for information systems . Artif. Intell. , 105 : 77 – 103 .
   Web of Science ®Google Scholar
• Hamrouni , T. , Valtchev , P. , Yahia , S. and Nguifo , E. About the lossless reduction of the minimal generator family of a context . Proceedings of the 5th International Conference on Formal Concept Analysis (ICFCA 2007) . Edited by: Kuznetsov , S. O. and Shmidt , S. Vol. 4390 , pp. 130 – 150 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Hartmann , S. and Link , S. 2006 . Deciding implication for functional dependencies in complex-value databases . Theoret. Comput. Sci. , 364 ( 2 ) : 212 – 240 .
   Web of Science ®Google Scholar
• Katona , G. and Tichler , K. Some contributions to the minimum representation problem of key systems . Foundations of Information and Knowledge Systems, Fourth International Symposium, FoIKS 2006, Budapest, Hungary, February 14–17, 2006, Proceeding . Edited by: Dix , J. and Hegner , S. J. Vol. 3861 , pp. 240 – 257 . Berlin : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Katona , G. , Sali , A. and Schewe , K. 2008 . TANE: An codes that attain minimum distance in every possible direction . Cent. Eur. J. Math. , 6 ( 1 ) : 1 – 11 .
   Google Scholar
• King , R. S. and Legendre , J. J. 2003 . Discovery of functional and approximate functional dependencies in relational databases . J. Appl. Math. Decis. Syst. , 7 ( 1 ) : 49 – 59 .
   Google Scholar
• Sali , A. Minimal keys in higher-order datamodels . Foundations of Information and Knowledge Systems, Third International Symposium, FoIKS 2004, Wilhelminenburg Castle, Austria, February 17–20, 2004, Proceedings . Edited by: Seipel , D. and Turull Torres , J. M. Vol. 2942 , pp. 242 – 251 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Sismanis , Y. , Brown , P. , Haas , P. J. and Reinwald , B. Gordian: Efficient and scalable discovery of composite keys . Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12–15, 2006, VLDB ’06 . Edited by: Dayal , U. , Whang , K. Y. , Lomet , D. B. , Alonso , G. , Lohman , G. M. , Kersten , M. L. , Cha , S. K. and Kim , Y.-K. pp. 691 – 182 . VLDB Endowment . Available at http://portal.acm.org/citation.cfm?id=1164187
   Google Scholar
• Tichler , K. 2004 . Extremal theorems for databases . Ann. Math. Artif. Intell. , 40 ( 1 ) : 165 – 182 .
   Web of Science ®Google Scholar
• S. Torgersen, Automatic design of relational databases, Ph.D. thesis, TR 89-1038, 1989
   Google Scholar