Characterising nested database dependencies by fragments of propositional logic

DOI10.1016/J.APAL.2007.11.004MaRDI QIDQ2478548zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 465520
• Deciding implication for functional dependencies in complex-value databases
• scientific article; zbMATH DE number 4003563
• scientific article; zbMATH DE number 3974346
• scientific article; zbMATH DE number 554492

Cites work

• scientific article; zbMATH DE number 3915665 (Why is no real title available?)
• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• scientific article; zbMATH DE number 43047 (Why is no real title available?)
• scientific article; zbMATH DE number 566081 (Why is no real title available?)
• scientific article; zbMATH DE number 1953122 (Why is no real title available?)
• scientific article; zbMATH DE number 1466150 (Why is no real title available?)
• scientific article; zbMATH DE number 1887335 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A mathematical introduction to logic.
• A relational model of data for large shared data banks
• An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
• An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
• Deciding implication for functional dependencies in complex-value databases
• Functional Dependencies in a Relational Database and Propositional Logic
• Functional and multivalued dependencies in nested databases generated by record and list constructor
• Matrix Rounding under the L_p-Discrepancy Measure and Its Application to Digital Halftoning
• On closed elements in closure algebras
• On the menbership problem for functional and multivalued dependencies in relational databases
• Semantics in databases
• The nested universal relation database model

Cited in

(10)

• Spoilt for Choice: Full First-Order Hierarchical Decompositions
• Characterisations of multivalued dependency implication over undetermined universes
• Appropriate inferences of data dependencies in relational databases
• Charting the completeness frontier of inference systems for multivalued dependencies
• Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
• Numerical constraints on XML data
• Functional dependencies on extended relations defined by regular languages
• Reasoning about functional and full hierarchical dependencies over partial relations
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
• On Inferences ofWeak Multivalued Dependencies

This page was built for publication: Characterising nested database dependencies by fragments of propositional logic

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