Closure via functional dependence simplification
In this paper, a method for computing the closure of a set of attributes according to a
specification of functional dependencies of the relational model is described. The main …
specification of functional dependencies of the relational model is described. The main …
Key roles of closed sets and minimal generators in concise representations of frequent patterns
T Hamrouni - Intelligent Data Analysis, 2012 - content.iospress.com
The last years witnessed an explosive progress in networking, storage, and processing
technologies resulting in an unprecedented amount of digitalization of data. Hence, there …
technologies resulting in an unprecedented amount of digitalization of data. Hence, there …
[PDF][PDF] A new closure algorithm based in logic: SLFD-Closure versus classical closures
The field of application of closure systems goes from theoretical areas as algebra or
geometry to practical areas as databases and artificial intelligence. In these practical areas …
geometry to practical areas as databases and artificial intelligence. In these practical areas …
An efficient reasoning method for dependencies over similarity and ordinal data
We present a new axiomatization of logic for dependencies in data with grades, including
ordinal data and data in an extension of Codd's model that takes into account similarity …
ordinal data and data in an extension of Codd's model that takes into account similarity …
[HTML][HTML] Non-deterministic ideal operators: An adequate tool for formalization in Data Bases
In this paper, we propose the application of formal methods to Software Engineering. The
most used data model is the relational model and we present, within the general framework …
most used data model is the relational model and we present, within the general framework …
An efficient algorithm for reasoning about fuzzy functional dependencies
A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is
introduced and based on it a method for efficiently reasoning about fuzzy functional …
introduced and based on it a method for efficiently reasoning about fuzzy functional …
Derivation digraphs for dependencies in ordinal and similarity-based data
L Urbanova, V Vychodil - Information Sciences, 2014 - Elsevier
We present graph-based method of reasoning with if-then rules describing dependencies
between attributes in ordinal and similarity-based data. The rules we consider have two …
between attributes in ordinal and similarity-based data. The rules we consider have two …
[PDF][PDF] Computing minimal keys using lattice theory
The problem of finding all the minimal keys deduced from a given set of functional
dependencies is NP-complete. There exists in the literature some classical algorithms used …
dependencies is NP-complete. There exists in the literature some classical algorithms used …
[PDF][PDF] Logic-based functional dependencies programming
Although classical logic was studied by logicians in depth, no efficient applications were
presented until the Robinson Resolution Rule was introduced. Thus, the Resolution Rule …
presented until the Robinson Resolution Rule was introduced. Thus, the Resolution Rule …
[PDF][PDF] Closure via Functional Dependence Simplification-special issue CMMSE 2010
A Moraa, P Corderoa, M Encisob, IP de Guzmána… - academia.edu
A method for computing the closure of a set of attributes according to a specification of
Functional Dependencies of the relational model is shown. The main feature of this method …
Functional Dependencies of the relational model is shown. The main feature of this method …