Finite approximatization of languages for representation of system properties: Axiomatization of dependencies

DOI10.1016/0020-0255(89)90006-6zbMath0676.68063OpenAlexW2084455499WikidataQ60468486 ScholiaQ60468486MaRDI QIDQ1123008

Sergey V. Petrov

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90006-6

zbMATH Keywords

relational databaseaxiomatization of dependencies

Mathematics Subject Classification ID

General systems (93A10) Artificial intelligence (68T99) Mechanization of proofs and logical operations (03B35) Information storage and retrieval of data (68P20)

Related Items (6)

On the finite and general implication problems of independence atoms and keys ⋮ A complete axiomatization of full acyclic join dependencies ⋮ Valuations in incomplete information databases ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of relation schemes and logical design of relational data bases. II
• Join dependencies in relational-database design
• Algebraic dependencies
• The theory of functional and subset dependencies over relational expressions
• On the Desirability of Acyclic Database Schemes
• Formal Systems for Tuple and Equality Generating Dependencies
• RECONSTRUCTABILITY ANALYSIS OF MULTI-DIMENSIONAL RELATIONS: A Theoretical Basis for Computer-Aided Determination of Acceptable Systems Models †
• A Complete Axiomatization of Full Join Dependencies
• On Axiomatizing Multivalued Dependencies in Relational Databases

This page was built for publication: Finite approximatization of languages for representation of system properties: Axiomatization of dependencies