Characterising nested database dependencies by fragments of propositional logic

DOI10.1016/j.apal.2007.11.004zbMath1142.68029OpenAlexW2106619679MaRDI QIDQ2478548

Sven Hartmann, Sebastian Link

Publication date: 28 March 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2007.11.004

zbMATH Keywords

propositional logicmultivalued dependencyBrouwerian algebraBoolean dependencylogic in databasesnested databases

Mathematics Subject Classification ID

Database theory (68P15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Appropriate inferences of data dependencies in relational databases ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ Reasoning about functional and full hierarchical dependencies over partial relations ⋮ Functional dependencies on extended relations defined by regular languages ⋮ Numerical constraints on XML data ⋮ Charting the completeness frontier of inference systems for multivalued dependencies ⋮ Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ Spoilt for Choice: Full First-Order Hierarchical Decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding implication for functional dependencies in complex-value databases
• Semantics in databases
• The nested universal relation database model
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• Functional and multivalued dependencies in nested databases generated by record and list constructor
• On closed elements in closure algebras
• Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
• On the menbership problem for functional and multivalued dependencies in relational databases
• An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
• Functional Dependencies in a Relational Database and Propositional Logic
• Matrix Rounding under the L_p-Discrepancy Measure and Its Application to Digital Halftoning
• A relational model of data for large shared data banks