scientific article; zbMATH DE number 3464827

zbMATH Open0296.68038MaRDI QIDQ4050122FDOQ4050122

Authors: W. W. Armstrong 

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited In (only showing first 100 items - show all)

• Symmetry in information flow
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Attribute-incremental construction of the canonical implication basis
• Fuzzy inequational logic
• Derivation digraphs for dependencies in ordinal and similarity-based data
• Armstrong databases for functional and inclusion dependencies
• The poset of closures as a model of changing databases
• Monotonic aggregation in deductive databases
• On propositional definability
• Characterisations of multivalued dependency implication over undetermined universes
• Dependence and independence
• Propositional logics of dependence
• Reduction of database independence to dividing in atomless Boolean algebras
• On the number of databases and closure operations
• Set relations and set systems induced by some families of integral domains
• Appropriate inferences of data dependencies in relational databases
• Autonomous sets for the hypergraph of all canonical covers
• Some combinatorial characteristics of closure operations
• Computable queries for relational data bases
• Implication and axiomatization of functional and constant constraints
• Charting the completeness frontier of inference systems for multivalued dependencies
• The functional dependence relation on hypergraphs of secrets
• The multiple facets of the canonical direct unit implicational basis
• Inclusion dependencies and their interaction with functional dependencies
• Stochastic independence, algebraic independence and abstract connectedness
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• The interaction of integrity constraints in an information system
• Partition semantics for relations
• From IF to BI. A tale of dependence and separation
• A finite axiomatization of conditional independence and inclusion dependencies
• Succinctness in dependency systems
• Functional dependencies in relations with null values
• Recent combinatorial results in the theory of relational databases
• Design by example: An application of Armstrong relations
• Generating a condensed representation for association rules
• Testing for existence of a covering Boyce-Codd normal form
• Rationally functional dependence
• Axiomatisation of functional dependencies in incomplete relations
• Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics
• Order dependency in the relational model
• Non-deterministic ideal operators: an adequate tool for formalization in data bases
• Adequacy of decompositions of relational databases
• Algebraic dependencies
• Logical foundations of possibilistic keys
• Axiomatizations of team logics
• Minimum matrix representation of closure operations
• Formal systems for join dependencies
• A note on relation schemes which are in 3NF but not in BCNF
• Membership problems for data dependencies in relational expressions
• Mixed transitivity for functional and multivalued dependencies in database relations
• A simple characterization of database dependency implication
• Interactions between dependencies and nested relational structures
• An algebraic theory of functional and multivalued dependencies in relational databases
• On the size of nonredundant FD-covers
• Some problems concerning keys for relation schemes and relations in the relational datamodel
• Functional and approximate dependency mining: database and FCA points of view
• A sharing-based approach to supporting adaptation in service compositions
• On a problem of Fagin concerning multivalued dependencies in relational databases
• Full hierarchical dependencies in fixed and undetermined universes
• Attribute reduction using functional dependency relations in rough set theory
• Functional and multivalued dependencies in nested databases generated by record and list constructor
• The presence of lattice theory in discrete problems of mathematical social sciences. Why.
• On minimum matrix representation of closure operations
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• Marketing impact on diffusion in social networks
• On dependence logic
• Axiomatizing first-order consequences in dependence logic
• Axiomatizing first-order consequences in independence logic
• Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
• RQL: a query language for rule discovery in databases
• Functional dependencies in relational databases: A lattice point of view
• Constraints in RDF
• Testing the universal instance assumption
• Optimizations in computing the Duquenne-Guigues basis of implications
• Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
• Boyce-Codd normal form decomposition
• On minimal sets of graded attribute implications
• Fuzzy logic programming reduced to reasoning with attribute implications
• Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time
• Selective inheritance of attribute values in relational databases
• The implication problem for functional dependencies and variants of marginal distribution equivalences
• Grelling on dependence
• Some generalized type functional dependencies formalized as equality set on matrices
• Some results on the deductive structure of join dependencies
• Categorical interpretations of cryptomorphisms and maps arising from matroidal and combinatorial contexts
• Generic dependencies and database design
• Partial dependencies in relational databases and their realization
• The characterization of branching dependencies
• Direct product decompositions of lattices, closures and relation schemes
• Characterizations for functional dependency and Boyce-Codd normal form families
• Reasoning about functional and full hierarchical dependencies over partial relations
• Explaining data with formal concept analysis
• Abstract functional dependency structures
• On the number of maximal dependencies in a data base relation of fixed order
• On the complexity of finding the set of candidate keys for a given set of functional dependencies
• Contribution to the theory of data base relations
• Normal forms and syntactic completeness proofs for functional independencies
• On the Existence of Armstrong Instances with Bounded Domains
• Independent database schemas
• Extracting credible dependencies for averaged one-dependence estimator analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050122)