Functional Dependencies in a Relational Database and Propositional Logic

DOI10.1147/rd.216.0534zbMath0366.68022OpenAlexW2132490332WikidataQ114613664 ScholiaQ114613664MaRDI QIDQ4142680

Ronald Fagin

Publication date: 1977

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.216.0534

Mathematics Subject Classification ID

Classical propositional logic (03B05) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items (48)

Logic of temporal attribute implications ⋮ A note on relation schemes which are in 3NF but not in BCNF ⋮ From IF to BI. A tale of dependence and separation ⋮ Database survivability under dynamic constraints ⋮ Optimal covers in the relational database model ⋮ Functional dependencies among Boolean dependencies ⋮ Positive Boolean dependencies ⋮ Logical and algorithmic properties of independence and their application to Bayesian networks ⋮ On propositional definability ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ A Correspondence Between Variable Relations And Three-Valued Propositional Logic ⋮ Mixed transitivity for functional and multivalued dependencies in database relations ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ A logic of graded attributes ⋮ Fuzzy inequational logic ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ The interaction of integrity constraints in an information system ⋮ Attribute dependencies for data with grades I^, ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ Axioms and algorithms for inferences involving probabilistic independence ⋮ Closure via functional dependence simplification ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ On sets of graded attribute implications with witnessed non-redundancy ⋮ Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time ⋮ Characterising nested database dependencies by fragments of propositional logic ⋮ Functional dependencies on extended relations defined by regular languages ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ A complete axiomatization of fuzzy functional dependencies using fuzzy function ⋮ Functional and multivalued dependencies in nested databases generated by record and list constructor ⋮ Minimal bases of temporal attribute implications ⋮ Fuzzy functional dependencies: a comparative survey ⋮ Proving semantic properties as first-order satisfiability ⋮ Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data ⋮ Supervenience, Dependence, Disjunction ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ Quasi-closed elements in fuzzy posets ⋮ Spoilt for Choice: Full First-Order Hierarchical Decompositions ⋮ Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics ⋮ A graphical interpretation of dependency structures in relational data bases ⋮ A theory of data dependencies over relational expressions ⋮ Theta-join and normalization ⋮ Abstract functional dependency structures ⋮ Order dependency in the relational model ⋮ Characterizations for functional dependency and Boyce-Codd normal form families ⋮ On functional dependencies in \(q\)-Horn theories ⋮ Monoidal functional dependencies ⋮ Inclusion dependencies and their interaction with functional dependencies ⋮ Functional dependencies, supervenience, and consequence relations

This page was built for publication: Functional Dependencies in a Relational Database and Propositional Logic