Non-deterministic ideal operators: an adequate tool for formalization in data bases
From MaRDI portal
Publication:2478434
Recommendations
Cites work
- A new algebraic tool for automatic theorem provers. Multisemilattice: A structure to improve the efficiency of provers in temporal logics
- Advances in Artificial Intelligence – SBIA 2004
- Algorithms for inferring functional dependencies from relations
- Applications of a categorical framework for conceptual data modeling
- Family of functional dependencies and its equivalent descriptions
- Functional and embedded dependency inference: A data mining point of view
- Functional dependencies in relational databases: A lattice point of view
- Generalizations of lattices via non-deterministic operators
- scientific article; zbMATH DE number 2086270 (Why is no real title available?)
- scientific article; zbMATH DE number 4201601 (Why is no real title available?)
- scientific article; zbMATH DE number 4083037 (Why is no real title available?)
- scientific article; zbMATH DE number 42986 (Why is no real title available?)
- scientific article; zbMATH DE number 108396 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 1974020 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 2086610 (Why is no real title available?)
- scientific article; zbMATH DE number 936267 (Why is no real title available?)
- Ideal non-deterministic operators as a formal framework to reduce the key finding problem
- On XML integrity constraints in the presence of DTDs
- Restricted ideals and the groupability property. Tools for temporal reasoning.
- Rough computational methods for information systems
- 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
(6)- Logic of temporal attribute implications
- Ideal non-deterministic operators as a formal framework to reduce the key finding problem
- scientific article; zbMATH DE number 1974020 (Why is no real title available?)
- Closure via functional dependence simplification
- On minimal sets of graded attribute implications
- A coalgebraic approach to non-determinism: applications to multilattices
This page was built for publication: Non-deterministic ideal operators: an adequate tool for formalization in data bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2478434)