Closure via functional dependence simplification
From MaRDI portal
Publication:4903555
DOI10.1080/00207160.2011.644275zbMath1257.68064OpenAlexW2050815550MaRDI QIDQ4903555
No author found.
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
Related Items
Scalable Visual Analytics in FCA ⋮ Formal Methods in FCA and Big Data ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Revising the link between \(L\)-Chu correspondences and completely lattice \(L\)-ordered sets. ⋮ Canonical dichotomous direct bases ⋮ Direct-optimal basis computation by means of the fusion of simplification rules ⋮ Inference of Mixed Information in Formal Concept Analysis ⋮ On homogeneousL-bonds and heterogeneousL-bonds ⋮ Quasi-closed elements in fuzzy posets ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ Interactive search by using minimal generators ⋮ A new kind of implication to reason with unknown information ⋮ Clustering and identification of core implications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Rough computational methods for information systems
- Functional dependencies in Horn theories
- Representation of propositional expert systems as partial functions
- Inferring minimal functional dependencies in Horn and q-Horn theories
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Some results about normal forms for functional dependency in the relational datamodel
- Non-deterministic ideal operators: an adequate tool for formalization in data bases
- On the equivalence between FDs in XML and FDs in relations
- OnL-fuzzy Chu correspondences
- Ideal non-deterministic operators as a formal framework to reduce the key finding problem
- Data, Schema, Ontology and Logic Integration
- On XML integrity constraints in the presence of DTDs
- BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
- An information-theoretic approach to normal forms for relational and XML data
- Fuzzy congruence relations on nd-groupoids
- A new normal form for the design of relational database schemata
- Functional Dependencies in a Relational Database and Propositional Logic
- Algorithms for inferring functional dependencies from relations
- Solving the Implication Problem for XML Functional Dependencies with Properties
- Programming Languages and Systems
- On the Complexity of Computing Generators of Closed Sets
