<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.35596/1729-7648-2024-22-6-62-69</article-id><article-id custom-type="elpub" pub-id-type="custom">bsuir-4024</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Использование нейросетей для решения задач прикладной логики</article-title><trans-title-group xml:lang="en"><trans-title>Usage of Neural Networks for Solving Applied Logic Problems</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Герман</surname><given-names>Ю. О.</given-names></name><name name-style="western" xml:lang="en"><surname>German</surname><given-names>Ju. O.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Герман Ю. О., канд. техн. наук, доц. каф. информационных технологий автоматизированных систем</p><p>г. Минск</p></bio><bio xml:lang="en"><p>German Ju. O., Cand. of Sci., Associate Professor at the Information Technologies in Automatized System Department</p><p>Minsk</p></bio><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Герман</surname><given-names>О. В.</given-names></name><name name-style="western" xml:lang="en"><surname>German</surname><given-names>O. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Герман Олег Витольдович, канд. техн. наук, доц. каф. информационных технологий автоматизированных систем</p><p>220013, г. Минск, ул. П. Бровки, 6</p><p>Тел.: +375 29 612-42-32</p></bio><bio xml:lang="en"><p>German Oleg Vitoldovich, Cand. of Sci., Associate Professor at the Information Technologies in Automatized System Department</p><p>220013, Minsk, P. Brovki St., 6</p><p>Tel.: +375 29 612-42-32</p></bio><email xlink:type="simple">ovgerman@tut.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>28</day><month>12</month><year>2024</year></pub-date><volume>22</volume><issue>6</issue><fpage>62</fpage><lpage>69</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Герман Ю.О., Герман О.В., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Герман Ю.О., Герман О.В.</copyright-holder><copyright-holder xml:lang="en">German J.O., German O.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/4024">https://doklady.bsuir.by/jour/article/view/4024</self-uri><abstract><p>Рассматривается использование эвристического нейросетевого решателя для решения NP-трудных задач (определения (не)противоречивости системы логических уравнений). Эта проблема актуальна и важна, например, при выполнении экспресс-анализа непротиворечивости базы знаний экспертной системы, принятии решений на основе нечетких логических моделей, распознавании многомерных объектов и др. Обученная нейросеть выполняет роль высокоэффективного эвристического решателя, причем количество уравнений и переменных, используемых в логической модели, мало влияет на скорость принятия решений нейросетью, одновременно вероятность точного решения для параметрически определенного класса задач близка к единице. Под параметрически определенным классом задач понимается множество задач, описываемых многомерными векторами параметров, удовлетворяющих некоторому общему закону распределения вероятностей. Одно такое семейство параметров, предложенное и использованное для обучения нейросети, приведено в статье. Показано, как генерировать противоречивые и непротиворечивые экземпляры индивидуальных систем логических уравнений. Проведена серия более чем из 200 экспериментов по апробации модели, получены границы доверительного интервала вероятности правильного решения, что позволяет судить об эффективности модели. Показано, как применить нейросеть для проверки (не)противоречивости логической модели знаний. Построенная модель может быть эффективно дополнена новыми векторами параметров и применена в различных областях прикладных исследований.</p></abstract><trans-abstract xml:lang="en"><p>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.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>нейросеть</kwd><kwd>система логических уравнений</kwd><kwd>эвристический поиск решения</kwd><kwd>проверка непротиворечивости</kwd></kwd-group><kwd-group xml:lang="en"><kwd>neural network</kwd><kwd>system of logical equations</kwd><kwd>heuristic search for a solution</kwd><kwd>consistency check</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Garey, M. R. Computers and Intractability: A Guide to the Theory of NP-Completeness / М. R. Garey, D. S. Johnson. New York: W. H. Freeman and Co., 1979.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Handbook of Satisiability / A. Biere [et al.] // IOS Press. Amsterdam, 2021.</mixed-citation><mixed-citation xml:lang="en">Biere A., Heule M., van Maaren Н., Walsh T. (2021) Handbook of Satisiability. IOS Press. Amsterdam.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Selsam, D. Guiding High Performance SAT Solvers with Unsat-Core Predictions / D. Selsam, N. Bjorner // arXiv. 2019. Р. 1–19.</mixed-citation><mixed-citation xml:lang="en">Selsam D., Bjorner N. (2019) Guiding High Performance SAT Solvers with Unsat-Core Predictions. arXiv. 1–19.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Machine Learning for SAT: Restricted Heuristics and New Graph Representations / М. Shirokikh [et al.] // arXiv. 2023. Р. 1–17.</mixed-citation><mixed-citation xml:lang="en">Shirokikh M., Shenbin M., Alekseev A., Nikolenko S. (2023) Machine Learning for SAT: Restricted Heuristics and New Graph Representations. arXiv. 1–17.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Machine Learning Methods in Solving the Boolean Satisfiability Problem / W. Guo [et al.] // arXiv. 2022. Р. 1–8.</mixed-citation><mixed-citation xml:lang="en">Guo W., Zhen H.-L., Li X., Yuan M., Jin Y. (2022) Machine Learning Methods in Solving the Boolean Satisfiability Problem. arXiv. 1–8.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Menai, M. B. Solving the Maximum Satisfiability Problem Using an Evolutionary Local Search Algorithm / M. B. Menai, M. Batouche // The International Arab Journal of Information Technology. 2005. Vol. 2, No 2. Р. 154–161.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">An Overview of Modern Learning Techniques in Constraint Solving / А. Popescu [et al.] // Journal of Intelligent Information Systems. 2022. Vol. 58. Р. 91–118.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Герман, О. В. Введение в теорию экспертных систем и обработку знаний / О. В. Герман. Минск: ДизайнПро, 1995.</mixed-citation><mixed-citation xml:lang="en">German O. V. (1995) Introduction to the Theory of Expert Systems and Knowledge Processing. Minsk, DesignPro Publ. (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Птичкин, В. А. Об эвристическом усилении метода резолюций / В. А. Птичкин, О. В. Герман, В. Г. Найденко // Автоматика и вычислительная техника. 1993. Вып. 21. С. 88–93.</mixed-citation><mixed-citation xml:lang="en">Ptichkin V. А., German О. V., Naydenko V. G. (1993) On Heuristic Strengthening the Resolution Method. Automatics and Computing Technique. (21), 88–93 (in Russian).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
