Accession Number : AD0744176

Title :   New Methods of Minimizing Boolean Functions and the Creation of an Automatic Minimizer,

Corporate Author : FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO

Personal Author(s) : Shereshevskii,N. I. ; Khoroshilskih,L. L. ; Tsygankov,Yu. I.

Report Date : 20 MAR 1972

Pagination or Media Count : 23

Abstract : Any function of logic algebra can be written as a disjunctive or conjunctive perfect normal form (DPNF, CPNF). Such notation in a number of cases is uneconomical because a large number of standard logic operators are necessary to synthesize it. The logic-algebra function can be represented most economically. At the present time, minimization problems are solved in the following classes: negation, conjunction, and disjunction. This paper will examine a new method of minimizing the DPNF. (Author)

Descriptors :   (*MATHEMATICAL LOGIC, SPECIAL FUNCTIONS(MATHEMATICAL)), ARTIFICIAL INTELLIGENCE, COMPUTER LOGIC, LOGIC CIRCUITS, OPTIMIZATION, USSR

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE