Closure via functional dependence simplification
From MaRDI portal
Publication:4903555
Recommendations
Cites work
- scientific article; zbMATH DE number 1629944 (Why is no real title available?)
- scientific article; zbMATH DE number 2086270 (Why is no real title available?)
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3942888 (Why is no real title available?)
- scientific article; zbMATH DE number 42986 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- scientific article; zbMATH DE number 1974020 (Why is no real title available?)
- scientific article; zbMATH DE number 859451 (Why is no real title available?)
- A new normal form for the design of relational database schemata
- Algorithms for inferring functional dependencies from relations
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- An information-theoretic approach to normal forms for relational and XML data
- BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
- Data, Schema, Ontology and Logic Integration
- Functional Dependencies in a Relational Database and Propositional Logic
- Functional dependencies in Horn theories
- Fuzzy congruence relations on nd-groupoids
- Ideal non-deterministic operators as a formal framework to reduce the key finding problem
- Inferring minimal functional dependencies in Horn and q-Horn theories
- Non-deterministic ideal operators: an adequate tool for formalization in data bases
- On XML integrity constraints in the presence of DTDs
- On \(L\)-fuzzy Chu correspondences
- On the Complexity of Computing Generators of Closed Sets
- On the equivalence between FDs in XML and FDs in relations
- Programming Languages and Systems
- Representation of propositional expert systems as partial functions
- Rough computational methods for information systems
- Solving the implication problem for XML functional dependencies with properties
- Some results about normal forms for functional dependency in the relational datamodel
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
Cited in
(17)- Interactive search by using minimal generators
- Advances in Artificial Intelligence – SBIA 2004
- Direct-optimal basis computation by means of the fusion of simplification rules
- Quasi-closed elements in fuzzy posets
- Functional Kleene Closures
- A new kind of implication to reason with unknown information
- Clustering and identification of core implications
- Automated prover for attribute dependencies in data with grades
- Revising the link between \(L\)-Chu correspondences and completely lattice \(L\)-ordered sets.
- scientific article; zbMATH DE number 64169 (Why is no real title available?)
- Inference of mixed information in formal concept analysis
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
- Formal Methods in FCA and Big Data
- Scalable Visual Analytics in FCA
- Canonical dichotomous direct bases
- LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
- On homogeneousL-bonds and heterogeneousL-bonds
This page was built for publication: Closure via functional dependence simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903555)
