J. Baixeries, M. Kaytoue, and A. Napoli, Computing functional dependencies with pattern structures, CLA, volume 972 of CEUR Workshop Proceedings, pp.175-186, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00763748

M. Baudinet, J. Chomicki, and P. Wolper, Constraint-Generating Dependencies, Journal of Computer and System Sciences, vol.59, issue.1, pp.94-115, 1999.
DOI : 10.1006/jcss.1999.1632
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2454

R. Belohlávek and V. Vychodil, Data Tables with Similarity Relations: Functional Dependencies, Complete Rules and Non-redundant Bases, Lecture Notes in Computer Science, vol.3882, pp.644-658, 2006.
DOI : 10.1007/11733836_45

L. Bertossi, S. Kolahi, and L. V. Lakshmanan, Data cleaning and query answering with matching dependencies and matching functions, Proceedings of the 14th International Conference on Database Theory, pp.268-279, 2011.

N. Caspard and B. Monjardet, The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey, Discrete Applied Mathematics, vol.127, issue.2, pp.241-269, 2003.
DOI : 10.1016/S0166-218X(02)00209-3
URL : https://hal.archives-ouvertes.fr/hal-00095569

A. Day, The lattice theory of fonctionnal dependencies and normal decompositions, International Journal of Algebra and Computation, issue.04, pp.2409-431, 1992.

J. Demetrovics, G. Hencsey, L. Libkin, and I. B. Muchnik, Normal form relation schemes: A new characterization, Acta Cybern, vol.10, issue.3, pp.141-153, 1992.

W. Fan, H. Gao, X. Jia, J. Li, and S. Ma, Dynamic constraints for record matching, The VLDB Journal, vol.29, issue.7, pp.495-520, 2011.
DOI : 10.1007/s00778-010-0206-6

B. Ganter and S. O. Kuznetsov, Pattern Structures and Their Projections, Conceptual Structures: Broadening the Base, Proceedings of the 9th International Conference on Conceptual Structures LNCS 2120, pp.129-142, 2001.
DOI : 10.1007/3-540-44583-8_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7648

B. Ganter and R. Wille, Formal Concept Analysis, 1999.

G. Graetzer, B. Davey, R. Freese, B. Ganter, M. Greferath et al., General Lattice Theory, Freeman, 1971.

Y. Huhtala, J. Kärkkäinen, P. Porkka, and H. Toivonen, Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies, The Computer Journal, vol.42, issue.2, pp.100-111, 1999.
DOI : 10.1093/comjnl/42.2.100

M. Kaytoue, Z. Assaghir, A. Napoli, and S. O. Kuznetsov, Embedding tolerance relations in formal concept analysis, Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM '10, pp.1689-1692, 2010.
DOI : 10.1145/1871437.1871705
URL : https://hal.archives-ouvertes.fr/inria-00600205

D. Simovici and S. Jaroszewicz, An axiomatization of partition entropy. Information Theory, IEEE Transactions on, vol.48, issue.7, pp.2138-2142, 2002.

D. A. Simovici, D. Cristofor, and L. Cristofor, Impurity measures in databases, Acta Informatica, vol.38, issue.5, pp.307-324, 2002.
DOI : 10.1007/s002360100078

S. Song and L. Chen, Efficient discovery of similarity constraints for matching dependencies, Data & Knowledge Engineering, vol.87, issue.0, p.2013
DOI : 10.1016/j.datak.2013.06.003

S. Song, L. Chen, and P. S. Yu, Comparable dependencies over heterogeneous data, The VLDB Journal, vol.23, issue.12, pp.253-274, 2013.
DOI : 10.1007/s00778-012-0285-7

T. L. Taylor, Raising the Stakes: E-Sports and the Professionalization of Computer Gaming, 2012.

J. Ullman, Principles of Database Systems and Knowledge-Based Systems, volumes 1?2, 1989.