Preview

Doklady BGUIR

Advanced search

Usage of Neural Networks for Solving Applied Logic Problems

https://doi.org/10.35596/1729-7648-2024-22-6-62-69

Abstract

The article deals with heuristic neural network-based solver for NP-hard problems (determining the (in)consistency of a system of logical equations). This problem is relevant and important, for example, when performing express analysis of the consistency of the knowledge base of an expert system, decision-ma king based on fuzzy logic models, recognition of multidimensional objects, etc. The trained neural network plays the role of a highly efficient heuristic solver, and the number of equations and variables used in the logical model has little effect on the speed of decision-making by the neural network, while the probability of an exact solution for a parametrically defined class of problems is close to one. A parametrically defined class of problems is understood as a set of problems described by multidimensional vectors of parameters that satisfy some general law of probability distribution. One such family of parameters, proposed and used for training a neural network, is given in the article. It is shown how to generate inconsistent and consistent instances of individual systems of logical equations. A series of more than 200 experiments to test the model was carried out, the limits of the confidence interval of the probability of a correct decision were obtained, which allows us to evaluate the effectiveness of the model. It is shown how to implement a neural network to check the (in)consistency of a logical knowledge model. The constructed model can be effectively supplemented with new parameter vectors and applied in various fields of applied research.

About the Authors

Ju. O. German
Belarusian State University of Informatics and Radioelectronics
Belarus

German Ju. O., Cand. of Sci., Associate Professor at the Information Technologies in Automatized System Department

Minsk



O. V. German
Belarusian State University of Informatics and Radioelectronics
Belarus

German Oleg Vitoldovich, Cand. of Sci., Associate Professor at the Information Technologies in Automatized System Department

220013, Minsk, P. Brovki St., 6

Tel.: +375 29 612-42-32



References

1. Garey M., Johnson D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, W. H. Freeman and Co. Publ.

2. Biere A., Heule M., van Maaren Н., Walsh T. (2021) Handbook of Satisiability. IOS Press. Amsterdam.

3. Selsam D., Bjorner N. (2019) Guiding High Performance SAT Solvers with Unsat-Core Predictions. arXiv. 1–19.

4. Shirokikh M., Shenbin M., Alekseev A., Nikolenko S. (2023) Machine Learning for SAT: Restricted Heuristics and New Graph Representations. arXiv. 1–17.

5. Guo W., Zhen H.-L., Li X., Yuan M., Jin Y. (2022) Machine Learning Methods in Solving the Boolean Satisfiability Problem. arXiv. 1–8.

6. Menai M. B., Batouche M. (2005) Solving the Maximum Satisfiability Problem Using an Evolutionary Local Search Algorithm. The International Arab Journal of Information Technology. 2 (2), 154–161.

7. Popescu A., Seda P.-E., Felfernig A., Uta M., Alas M., Le V-M. (2022) An Overview of Modern Learning Techniques in Constraint Solving. Journal of Intelligent Information Systems. 58, 91–118.

8. German O. V. (1995) Introduction to the Theory of Expert Systems and Knowledge Processing. Minsk, DesignPro Publ. (in Russian).

9. Ptichkin V. А., German О. V., Naydenko V. G. (1993) On Heuristic Strengthening the Resolution Method. Automatics and Computing Technique. (21), 88–93 (in Russian).


Review

For citations:


German J.O., German O.V. Usage of Neural Networks for Solving Applied Logic Problems. Doklady BGUIR. 2024;22(6):62-69. (In Russ.) https://doi.org/10.35596/1729-7648-2024-22-6-62-69

Views: 96


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1729-7648 (Print)
ISSN 2708-0382 (Online)