کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
437667 | 690170 | 2010 | 12 صفحه PDF | دانلود رایگان |

The notion of dependencies between “attributes” arises in many areas such as relational databases, data analysis, data-mining, formal concept analysis, knowledge structures …. Formalization of dependencies leads to the notion of so-called full implicational systems (or full family of functional dependencies) which is in one-to-one correspondence with the other significant notions of closure operator and of closure system. An efficient generation of a full implicational system (or a closure system) can be performed from equivalent implicational systems and in particular from the bases for such systems, for example, the so-called canonical basis. This paper shows the equality between five other bases originating from different works and satisfying various properties (in particular they are unit implicational systems). The three main properties of this unique basis are the directness, canonical and minimal properties, whence the name canonical direct unit implicational basis given to this unit implicational system. The paper also gives a nice characterization of this canonical basis and makes precise its link with the prime implicants of the Horn function associated to a closure operator. It concludes that it is necessary to compare more closely related works made independently, and with a different terminology, in order to take advantage of the really new results in these works.
Journal: Theoretical Computer Science - Volume 411, Issues 22–24, 17 May 2010, Pages 2155-2166