MINIMIZATION OF THE SEARCH TREE IN SEARCHING FOR THE ROOTS OF LARGE SYSTEMS OF LOGICAL EQUATIONS

摘要

Two methods of solution of systems of logical equations, search of the equations and search of the arguments, are considered. The equations and arguments are made to correspond to levels of the search tree. To accelerate the calculations two methods of minimization of the tree, one based on efficient sorting of the equations and the other on efficient sorting of the arguments, are proposed. Data on a software implementation of the methods and results of a computer experiment are presented.