Abstract:
The proposed algorithm for solution of problems such as unification, siting, cove- Ting, and tracing a disjunctive normal form, minimal, shortest, containing a minimal number of letters with negations approximates irregular initial data as regular. A computing experiment confirms the effectiveness of the algorithm.
Fulltext:
PDF file (1741 kB)