Spoilt for Choice: Full First-Order Hierarchical Decompositions

DOI10.1007/978-3-642-02261-6_21zbMath1246.68110OpenAlexW2159475823MaRDI QIDQ3638288

Sebastian Link

Publication date: 2 July 2009

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02261-6_21

zbMATH Keywords

propositional logicaxiomatisationdatabase decompositiondatabase constraint

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Charting the completeness frontier of inference systems for multivalued dependencies
• Inferences of multivalued dependencies in fixed and undetermined universes
• Semantic foundations of 4NF in relational database design
• Full hierarchical dependencies in fixed and undetermined universes
• Characterising nested database dependencies by fragments of propositional logic
• ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS
• Numerical Constraints for XML
• On the menbership problem for functional and multivalued dependencies in relational databases
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Horn clauses and database dependencies
• Functional Dependencies in a Relational Database and Propositional Logic
• Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes
• A relational model of data for large shared data banks
• Foundations of Information and Knowledge Systems