Theory of Multivalued Dependencies Let D denote a set of functional and multivalued dependencies.The closure D+of D is the set of all functional and multivalued dependencies logically implied by D. Sound and complete inference rules for functional and multivalued dependencies: 1.Reflexivity rule.If a is a set of attributes and Bc a,then a>B holds. 2.Augmentation rule.If a>B holds and y is a set of attributes,then y o-→y B holds. 3.Transitivity rule.lfo-→βholds and y a-→y B holds,then a-→y holds. Database System Concepts,5th Ed. C.2 ©Silberschat乜，Korth and SudarshanDatabase System Concepts, 5 C.2 ©Silberschatz, Korth and Sudarshan th Ed. Theory of Multivalued Dependencies Let D denote a set of functional and multivalued dependencies. The closure D+ of D is the set of all functional and multivalued dependencies logically implied by D. Sound and complete inference rules for functional and multivalued dependencies: 1. Reflexivity rule. If  is a set of attributes and   , then  → holds. 2. Augmentation rule. If  →  holds and  is a set of attributes, then  →  holds. 3. Transitivity rule. If  →  holds and  →  holds, then  → holds