Cube Representation.

• Let’s draw a cube. Each vertex is a possible term, AND two adjacent vertices only differ in one variable.

• Now, draw a dot for each term from our boolean expression, and group dots that are connected.

• An edge that connects two dots means that we can apply the unification theorem to merge those two terms. The variable that differs is dropped.

• By applying the unification theorem twice, we can merge 4 vertices that are fully connected.

• More generally, by applying the unification theorem 2n times, we can merge n vertices.

A’B’C’

AB’C’

AB’C

ABC

A’BC’

A’B’C

A’BC

A

B

C

The above cube shows the

expression A’BC + ABC’ +

ABC + AB’C + AB’C’.

It simplifies to:

A + BC’

ABC’

Previous slide

Next slide

Back to first slide

View graphic version