Inference Rules

Inference Rules in relational database theory are formal rules used to derive new functional dependencies from a given set of functional dependencies. These rules help in:

• Proving whether a functional dependency logically follows from a given set.

• Computing attribute closure.

• Finding candidate keys.

• Verifying dependency preservation during normalization.

The most important inference rules are the three Armstrong’s Axioms, along with several derived rules built using them.

Basic Inference Rules

Reflexivity Rule

If:

Y \subseteq X \Rightarrow X \to Y

then every set of attributes functionally determines its subsets.

These are called trivial functional dependencies.

Example

If:

X = {A, B, C}
Y = {A, B}

then:

{A, B, C} → {A, B}

because {A, B} is a subset of {A, B, C}.

Augmentation Rule

If:

X \to Y \Rightarrow XZ \to YZ

for any attribute set Z.

This means adding the same attributes to both sides of a functional dependency does not affect its validity.

Example

If:

A → B

then:

{A, C} → {B, C}

Transitivity Rule

If:

X \to Y ; \text{and} ; Y \to Z \Rightarrow X \to Z

then dependencies can be chained together.

Example

If:

A → B
B → C

then:

A → C

Derived Inference Rules

Using Armstrong’s three basic axioms, several additional useful rules can be derived.

Union Rule

If:

X \to Y ; \text{and} ; X \to Z \Rightarrow X \to YZ

then the same determinant can determine the union of attributes.

Example

If:

A → B
A → C

then:

A → BC

Decomposition Rule

If:

X \to YZ \Rightarrow X \to Y ; \text{and} ; X \to Z

then a functional dependency can be split into smaller dependencies.

Example

If:

A → BC

then:

A → B
A → C

Pseudotransitivity Rule

If:

X \to Y ; \text{and} ; YZ \to W \Rightarrow XZ \to W

then transitivity can be extended with extra attributes.

Example Idea

If:

A → B
BC → D

then:

AC → D

because A determines B, and together with C, it determines D.

How Inference Rules Help in Database Design

Inference rules are extremely important because they:

• Allow systematic derivation of implied functional dependencies.

• Help compute attribute closure.

• Support candidate key discovery.

• Help check whether a dependency logically follows from a given set.

• Assist in finding minimal covers and performing normalization.

Why Inference Rules Matter?

These rules form the mathematical foundation of relational database theory.

They are used heavily in:

• Functional dependency analysis

• Normalization (2NF, 3NF, BCNF)

• Schema decomposition

• Dependency preservation checks

For beginners, they provide a logical framework to reason about how attributes depend on each other in a database schema.

Summary

Inference Rules in DBMS are formal logical rules used to derive new functional dependencies from existing ones. The most important rules are Armstrong’s Axioms — Reflexivity, Augmentation, and Transitivity — along with derived rules like Union, Decomposition, and Pseudotransitivity. These rules are fundamental for dependency analysis, closure computation, candidate key identification, and normalization in relational database design.