Instruments and Systems: Monitoring, Control, and Diagnostics Annotation << Back Automatic Verification of Transformation Chains of Symbolic Inequalities Based on Logical Rules Search V.I. KATSMAN Lots of technical sciences problems require the skills of performing transformations of symbolic inequalities to be solved. To consolidate these skills, learner need to solve a large volume of tasks on inequalities transformations, that entails the need of verifi cation of the solutions. Many platforms have already been implemented that allow to automate the verification of solutions. Generally, these systems only check the answer, but not the progress of the problem. This approach of verification leaves the possibility of getting the correct answer and the task counted if the decision is not fully thought out or incorrect. The article proposes a method for automatic verifi cation of problem solutions based on sequential verification of completed transformations by efficiently iterating through the rules that allowed these transformations to be performed. At each step of the solution, the system iterates through the allowed transformations, trying to find one, that learner used. Problems of ambiguity of the recording form are solved by a combination of testing method, unification, and structuring of the recording rules. The proposed method of automatic verification was tested on students of junior courses of the Polytechnic and Electrical engineering Universities and showed good results: the productivity of teaching staff when checking tasks increased more than 4 times. Keywords: education, gamification, transformations of symbolic inequalities, automated solution verification, transformation rules. DOI: 10.25791/pribor.11.2020.1221 Pp. 19-24.