Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
From MaRDI portal
Publication:1123008
DOI10.1016/0020-0255(89)90006-6zbMath0676.68063WikidataQ60468486 ScholiaQ60468486MaRDI QIDQ1123008
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
93A10: General systems
68T99: Artificial intelligence
03B35: Mechanization of proofs and logical operations
68P20: Information storage and retrieval of data
Related Items
Appropriate inferences of data dependencies in relational databases, Characterisations of multivalued dependency implication over undetermined universes, Valuations in incomplete information databases
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