Closure via functional dependence simplification
From MaRDI portal
Publication:4903555
DOI10.1080/00207160.2011.644275zbMATH Open1257.68064OpenAlexW2050815550MaRDI QIDQ4903555FDOQ4903555
Authors:
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.644275
Recommendations
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On XML integrity constraints in the presence of DTDs
- Solving the implication problem for XML functional dependencies with properties
- Rough computational methods for information systems
- Fuzzy congruence relations on nd-groupoids
- Algorithms for inferring functional dependencies from relations
- Functional Dependencies in a Relational Database and Propositional Logic
- Data, Schema, Ontology and Logic Integration
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Title not available (Why is that?)
- A new normal form for the design of relational database schemata
- Title not available (Why is that?)
- On the equivalence between FDs in XML and FDs in relations
- Title not available (Why is that?)
- An information-theoretic approach to normal forms for relational and XML data
- Non-deterministic ideal operators: an adequate tool for formalization in data bases
- BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functional dependencies in Horn theories
- Representation of propositional expert systems as partial functions
- On \(L\)-fuzzy Chu correspondences
- On the Complexity of Computing Generators of Closed Sets
- Inferring minimal functional dependencies in Horn and q-Horn theories
- Title not available (Why is that?)
- Some results about normal forms for functional dependency in the relational datamodel
- Ideal non-deterministic operators as a formal framework to reduce the key finding problem
- Programming Languages and Systems
- Title not available (Why is that?)
Cited In (17)
- A new kind of implication to reason with unknown information
- Clustering and identification of core implications
- Advances in Artificial Intelligence – SBIA 2004
- Title not available (Why is that?)
- Automated prover for attribute dependencies in data with grades
- Revising the link between \(L\)-Chu correspondences and completely lattice \(L\)-ordered sets.
- Inference of mixed information in formal concept analysis
- Functional Kleene Closures
- LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
- Direct-optimal basis computation by means of the fusion of simplification rules
- Quasi-closed elements in fuzzy posets
- On homogeneousL-bonds and heterogeneousL-bonds
- Canonical dichotomous direct bases
- Formal Methods in FCA and Big Data
- Scalable Visual Analytics in FCA
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
- Interactive search by using minimal generators
Uses Software
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)
