Method of Simplifying the Logical Schemes of Algorithms Allowing for Unused Sets of Values of the Variables

A method of simplifying the logical schemes of algorithms is considered which is based on taking into account the sets of values of the variables not encountered in satisfying the algorithm. The method of simplifying the logical schemes of algorithms (LSA) consists of the transformation of transition formulas with unsupplemented definitions and the deduction of a general solution from which a particular solution is selected as a transition formula. Then the transition formulas are transformed into a logical scheme of algorithms. Allowing for the unused sets enables the total number of logical conditions to be reduced, and the order in which they are tested to be changed, and in some cases this may lead to an additional combination of identical expressions in the LSA. An example of the simplification of an LSA is given.