title: ÐÑÐ¸Ð¼ÐµÐ½ÐµÐ½Ð¸Ðµ ÑÑÑÐ°ÑÐµÐ³Ð¸Ð¹ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸ Ð¼ÐµÑÐ¾Ð´Ð° ÑÐµÐ·Ð¾Ð»ÑÑÐ¸Ð¹ Ð´Ð»Ñ ÐºÐ¾Ð¼Ð¿ÑÑÑÐµÑÐ½Ð¾Ð³Ð¾ ÑÐµÑÐµÐ½Ð¸Ñ Ð¼Ð°ÑÐµÐ¼Ð°ÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð·Ð°Ð´Ð°Ñ
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¼Ð°Ð³Ð¸ÑÑÑÐ°
titleType: Subtitle
title: Application of optimization strategies of the resolution method to computer-aided solving of mathematical problems
Creators: name: Ð Ð°Ð·ÑÐ²Ð°ÐµÐ², ÐÐ°Ð½Ð¸Ð»
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2023
Subjects: ÑÑÑÐ°ÑÐµÐ³Ð¸Ð¸ Ð¼ÐµÑÐ¾Ð´Ð° ÑÐµÐ·Ð¾Ð»ÑÑÐ¸Ð¹
Ð³ÐµÐ½ÐµÑÐ¸ÑÐµÑÐºÐ¸Ðµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ñ
ÑÐ¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ðµ Ð²ÑÐ²Ð¾Ð´Ð¾Ð¼
Ð°Ð²ÑÐ¾Ð¼Ð°ÑÐ¸ÑÐµÑÐºÐ¾Ðµ Ð´Ð¾ÐºÐ°Ð·Ð°ÑÐµÐ»ÑÑÑÐ²Ð¾ ÑÐµÐ¾ÑÐµÐ¼
resolution method strategies
genetic algorithms
inference control
automated theorem proving

description: ÐÐ²ÑÐ¾Ð¼Ð°ÑÐ¸ÑÐµÑÐºÐ¾Ðµ Ð´Ð¾ÐºÐ°Ð·Ð°ÑÐµÐ»ÑÑÑÐ²Ð¾ ÑÐµÐ¾ÑÐµÐ¼ Ð½Ð°Ð¿ÑÐ°Ð²Ð»ÐµÐ½Ð¾ Ð½Ð° ÑÐµÑÐµÐ½Ð¸Ðµ Ð¼Ð°ÑÐµÐ¼Ð°ÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð·Ð°Ð´Ð°Ñ Ð¿ÑÐ¸ Ð¿Ð¾Ð¼Ð¾ÑÐ¸ ÐºÐ¾Ð¼Ð¿ÑÑÑÐµÑÐ°, Ð±ÐµÐ· ÑÑÐ°ÑÑÐ¸Ñ ÑÐµÐ»Ð¾Ð²ÐµÐºÐ°. ÐÐ¾ÐºÐ°Ð·Ð°ÑÐµÐ»ÑÑÑÐ²Ð° ÑÐµÐ¾ÑÐµÐ¼ Ð¿ÐµÑÐ²Ð¾Ð³Ð¾ Ð¿Ð¾ÑÑÐ´ÐºÐ° Ð¸ÑÑÑÑÑ Ð² Ð±ÐµÑÐºÐ¾Ð½ÐµÑÐ½Ð¾Ð¼ Ð¿ÑÐ¾ÑÑÑÐ°Ð½ÑÑÐ²Ðµ Ð²Ð¾Ð·Ð¼Ð¾Ð¶Ð½ÑÑ Ð²ÑÐ²Ð¾Ð´Ð¾Ð². Ð ÑÑÐ¸Ñ ÑÑÐ»Ð¾Ð²Ð¸ÑÑ ÑÐµÑÐ°ÑÑÑÑ ÑÐ¾Ð»Ñ Ð¸Ð³ÑÐ°ÑÑ ÑÑÑÐ°ÑÐµÐ³Ð¸Ð¸ Ð¿Ð¾Ð¸ÑÐºÐ° Ð´Ð¾ÐºÐ°Ð·Ð°ÑÐµÐ»ÑÑÑÐ², Ð² ÑÐ°ÑÑÐ½Ð¾ÑÑÐ¸ ÑÑÐµÐ¼Ð° Ð²ÑÐ±Ð¾ÑÐ° ÑÐ»ÐµÐ´ÑÑÑÐµÐ¹ ÐºÐ»Ð°ÑÐ·Ñ Ð´Ð»Ñ Ð¾Ð±ÑÐ°Ð±Ð¾ÑÐºÐ¸ Ð² Ð¿ÑÐ¾ÑÐµÑÑÐµ Ð´Ð¾ÐºÐ°Ð·Ð°ÑÐµÐ»ÑÑÑÐ²Ð°. Ð ÑÐ°Ð±Ð¾ÑÐµ Ð¾Ð¿Ð¸ÑÑÐ²Ð°ÐµÑÑÑ ÑÐ¿Ð¾ÑÐ¾Ð± Ð¿ÑÐ¸Ð¼ÐµÐ½ÐµÐ½Ð¸Ñ Ð³ÐµÐ½ÐµÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ðº Ð³ÐµÐ½ÐµÑÐ°ÑÐ¸Ð¸ Ð½Ð¾Ð²ÑÑ ÑÑÐµÐ¼ Ð²ÑÐ±Ð¾ÑÐ° ÐºÐ»Ð°ÑÐ·Ñ Ð¿ÑÑÐµÐ¼ ÐºÐ¾Ð¼Ð±Ð¸Ð½Ð°ÑÐ¸Ð¸ Ð¿ÑÐµÐ´Ð¾ÑÑÐ°Ð²Ð»ÐµÐ½Ð½ÑÑ Ð¿ÑÑÐ²ÐµÑÐ¾Ð¼ Ð¾ÑÐµÐ½Ð¾ÑÐ½ÑÑ ÑÑÐ½ÐºÑÐ¸Ð¹ Ð¸ Ð¸Ñ Ð¿Ð°ÑÐ°Ð¼ÐµÑÑÐ¾Ð². ÐÑÐ¾Ð¸Ð·Ð²ÐµÐ´ÐµÐ½Ð¾ ÑÐºÑÐ¿ÐµÑÐ¸Ð¼ÐµÐ½ÑÐ°Ð»ÑÐ½Ð¾Ðµ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ Ð¿Ð¾Ð»ÑÑÐµÐ½Ð½Ð¾Ð¹ Ð¿ÑÐ¸ Ð¿Ð¾Ð¼Ð¾ÑÐ¸ Ð³ÐµÐ½ÐµÑÐ¸ÑÐµÑÐºÐ¾Ð³Ð¾ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° ÑÑÑÐ°ÑÐµÐ³Ð¸Ð¸ ÑÐ¾ ÑÑÑÐ°ÑÐµÐ³Ð¸ÐµÐ¹ PickGiven5 Ð½Ð° ÑÐ¾Ð·Ð´Ð°Ð½Ð½Ð¾Ð¼ Ð¿ÑÑÐ²ÐµÑÐµ Ð´Ð»Ñ Ð»Ð¾Ð³Ð¸ÐºÐ¸ Ð¿ÐµÑÐ²Ð¾Ð³Ð¾ Ð¿Ð¾ÑÑÐ´ÐºÐ° Ñ ÑÐ°Ð²ÐµÐ½ÑÑÐ²Ð¾Ð¼. Ð¢Ð°ÐºÐ¶Ðµ Ð¿ÑÐ¾Ð¸Ð·Ð²ÐµÐ´ÐµÐ½Ð¾ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ ÑÑÑÐ°ÑÐµÐ³Ð¸Ð¹ Ð¿ÑÐ¸ ÑÐµÑÐµÐ½Ð¸Ð¸ Ð¿ÑÐ¸ÐºÐ»Ð°Ð´Ð½Ð¾Ð¹ Ð·Ð°Ð´Ð°ÑÐ¸ Ð¾ ÐºÐ»Ð¸ÐºÐµ. ÐÐ¾Ð»ÑÑÐµÐ½Ð½Ð°Ñ ÑÑÑÐ°ÑÐµÐ³Ð¸Ñ Ð¿Ð¾ÐºÐ°Ð·Ð°Ð»Ð° ÑÐ¾ÑÐ¾ÑÐ¸Ðµ ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÑ.
description: Automatic theorem proving aims at solving mathematical problems with the help of a computer, without human involvement. Proofs of first-order theorems are searched in an infinite space of possible inferences. In these conditions, strategies for finding proofs, in particular the scheme for selecting the next clause to be processed in the proof process, play a decisive role. The paper describes a way to apply genetic algorithms to generate new clause selection schemes by combining the estimation functions and their parameters provided by the prover. An experimental comparison is made between the strategy obtained with the genetic algorithm and the PickGiven5 strategy on the created prover for first-order logic with equality. The strategies were also compared when solving the applied clique problem. The obtained strategy showed good results.