@article{Solomko_Antoniuk_Voitovych_Ulianovska_Pavlova_Biletskyi_2023, title={Implementing the method of figurative transformations to minimize partially defined Boolean functions}, volume={1}, url={https://journals.uran.ua/eejet/article/view/273293}, DOI={10.15587/1729-4061.2023.273293}, abstractNote={<p>This paper reports a research that established the possibility of increasing the effectiveness of the method of figurative transformations to minimize partially defined Boolean functions. The method makes it possible, without loss of functionality, to reduce the complexity of the minimization procedure, compared to sorting out binary definitions of partially defined Boolean functions. The interpretation of the result is that the 2-(<em>n</em>, <em>b</em>)-design, 2-(<em>n</em>, <em>x</em>/<em>b</em>)-design systems are a reflection of logical operations. Therefore, the identification of such combinatorial systems in the truth table of logical functions directly and unambiguously establishes the location of logical operations for equivalent transformations of Boolean expressions. This, in turn, implicates an algorithm for simplifying Boolean functions, including partially defined Boolean functions. Thus, the method of figurative transformations simplifies and speeds up the procedure for minimizing partially defined Boolean functions, compared to analogs. This indicates that the visual-matrix form of the analytical method still has the prospect of increasing its hardware capabilities, including in terms of minimizing partially defined Boolean functions.</p>
<p>It has been experimentally confirmed that the method of figurative transformations increases the efficiency of minimizing partially defined Boolean functions, compared with analogs, by 100–200 %.</p>
<p>There is reason to argue about the possibility of increasing the efficiency of minimizing partially defined Boolean functions in the main and polynomial bases by the specified method. The effectiveness of the method, in particular, is ensured by carrying out all operations of generalized gluing of variables for dead-end disjunctive normal forms (DNF), followed by the use of implicant tables; optimal combination of a sequence of logical operations for gluing variables</p>}, number={4 (121)}, journal={Eastern-European Journal of Enterprise Technologies}, author={Solomko, Mykhailo and Antoniuk, Mykola and Voitovych, Ihor and Ulianovska, Yuliia and Pavlova, Nataliia and Biletskyi, Viacheslav}, year={2023}, month={Feb.}, pages={6–25} }