Title :
On the Determination of Complete Sets of Logical Functions
Author :
Petrick, Stanley R. ; Sethares, George C.
fDate :
3/1/1968 12:00:00 AM
Abstract :
Abstract—A procedure is described, based on a theorem of Post, for determining the nonredundant complete sets of logical functions. Kudielka and Oliva´s determination of these functions for two and three variables was verified by means of this procedure in less than a minute of computer time. The procedure requires the computation of irredundant coverings, and novel features of the algorithm which was used to carry out this computation are also described.
Keywords :
Index terms—Complete sets, irredundant coverings, logical functions, minimal coverings, programming.; Functional programming; Laboratories; Logic programming; Table lookup; Testing; Index terms—Complete sets, irredundant coverings, logical functions, minimal coverings, programming.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1968.229101
