Visualizing Boolean operations on a hypercube

Authors:
M. C. Clarke
Affiliations:
Department of Computer Science, University of Natal Pietermaritzburg, South Africa
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1994

Citing 3
Cited 0

The graph of a boolean function

Journal of Experimental & Theoretical Artificial Intelligence
Possible models diagrams: a visual alternative to truth tables

SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
Gates accept concurrent behavior

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Quantified Score

Hi-index	0.98

Visualization

Abstract

Although it is known that every Boolean function can be represented as a subgraph of a hypercube [1], the implications of this fact have been little explored. We show a method for constructing such graphs which allows any formula of propositional logic to be visually represented. Boolean operations can be defined as manipulations of such graphs. A simple method is shown whereby the validity of propositional sequents may be checked.