The multiple facets of the canonical direct unit implicational basis
نویسندگان
چکیده
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 oneto-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 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 it 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 different terminology in order to take advantage of the really new results in these works.
منابع مشابه
Ordered direct implicational basis of a finite closure system
Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an impli...
متن کاملThe Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases
A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair (X, e) of a subset X, called a stem, and an element e 6∈ X, called a root. We introduce a notion called a ‘prime stem,’ which plays the key role in this article. Every prime stem is shown to be a ps...
متن کاملCanonical Inference for Implicational Systems
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries. We investigate what canonicity means for implicational systems that are axiomatizations of Moore families – or, equivalently, of propositional Horn theories. We build a correspondence between implicational systems an...
متن کاملOn the Substantive and Predictive Validity Facets of the University Entrance Exam for English Majors
This study examined the substantive and predictive validity facets of the University Entrance Examination for English Major (UEEEM) students. To that aim, 111 English major students were recruited to report their scores on each of the subtests of the test as well as their grade point average. Sequential multiple regressions and factor analysis were used in the analysis of the data. Results ackn...
متن کاملCanonical Horn Representations and Query Learning
We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a natural notion of implicational size. We extend the canonical representation to general Horn, by providing a reduction from definite to general Horn CNF. We show how this representation relates to two topics in query learning the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 411 شماره
صفحات -
تاریخ انتشار 2010