Computing premises of a minimal cover of functional dependencies is intractable

The problem of recognizing whether a subset of attributes is a premise of a minimal cover of functional dependencies of a relation is shown to be coNP-complete. The complexity of some related decision, enumerating, and sampling problems on functional dependencies, FCA implications, and closed sets of attributes is discussed.

[1]  Baris Sertkaya,et al.  Towards the Complexity of Recognizing Pseudo-intents , 2009, ICCS.

[2]  Sergei O. Kuznetsov,et al.  On the Intractability of Computing the Duquenne?Guigues Bas , 2004, J. Univers. Comput. Sci..

[3]  Sergei O. Kuznetsov,et al.  Some decision and counting problems of the Duquenne-Guigues basis of implications , 2008, Discret. Appl. Math..

[4]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[5]  Sergei O. Kuznetsov,et al.  Machine Learning on the Basis of Formal Concept Analysis , 2001 .

[6]  Toshihide Ibaraki,et al.  Functional Dependencies in Horn Theories , 1999, Artif. Intell..

[7]  Roni Khardon.  Translating between Horn Representations and their Characteristic Models , 1995, J. Artif. Intell. Res..

[8]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[9]  Baris Sertkaya.  Some Computational Problems Related to Pseudo-intents , 2009, ICFCA.

[10]  Ronen Feldman,et al.  Book Reviews: The Text Mining Handbook: Advanced Approaches to Analyzing Unstructured Data by Ronen Feldman and James Sanger , 2008, CL.

[11]  David Loshin.  Master Data Management , 2008 .

[12]  Sebastian Rudolph.  Some Notes on Pseudo-closed Sets , 2007, ICFCA.

[13]  Howard J. Hamilton,et al.  Mining functional dependencies from data , 2007, Data Mining and Knowledge Discovery.

[14]  Felix Distel,et al.  On the complexity of enumerating pseudo-intents , 2011, Discret. Appl. Math..

[15]  Felix Distel.  Hardness of Enumerating Pseudo-intents in the Lectic Order , 2010, ICFCA.

[16]  Sergei O. Kuznetsov,et al.  Counting Pseudo-intents and #P-completeness , 2006, ICFCA.

[17]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[18]  Kawaljeet Singh,et al.  A Descriptive Classification of Causes of Data Quality Problems in Data Warehousing , 2010 .