Abstract
In connection with applications, the solution of a system of logical equations plays an important role in computational mathematics and in many other areas. As a result, many new directions and algorithms for solving systems of logical equations are being developed. One of these directions is transformation into the real continuous domain. The real continuous domain is a richer domain to work with because it features many algorithms, which are well designed. In this study, firstly, we transformed any system of logical equations in the unit n-dimensional cube Kn into a system of polylinear–polynomial equations in a mathematically constructive way. Secondly, we proved that if we slightly modify the system of logical equations, namely, add no more than one special equation to the system, then the resulting system of logical equations and the corresponding system of polylinear–polynomial equations in Kn+1 is equivalent. The paper proposes an algorithm and proves its correctness. Based on these results, further research plans are developed to adapt the proposed method.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference22 articles.
1. Solution of systems of Boolean equations via the integer domain
2. On one method for solving systems of Boolean algebraic equations;Barotov;Mod. Math. Concept Innov. Math. Educ.,2021
3. On optimizing the satisfiability (SAT) problem
4. Global optimization for satisfiability (SAT) problem
5. How to Solve Very Large-Scale Satisfiability (VLSS) Problems;Gu,1990
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献