Informatics and Automation
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Informatics and Automation, 2021, Issue 20, volume 3, Pages 562–590
DOI: https://doi.org/10.15622/ia.2021.3.3
(Mi trspy1153)
 

This article is cited in 4 scientific papers (total in 4 papers)

Artificial Intelligence, Knowledge and Data Engineering

Formalization of regulatory texts

M. Voronova, V. Pimenovb

a Moscow State University of Psychology & Education
b Saint-Petersburg State University of Industrial Technologies and Design
Abstract: Modern information technologies provide text manipulation processes with high efficiency. First of all, this means storing, editing, and formatting texts and their components. Having achieved significant success in developing tools for content-free computer text processing, researchers faced problems with their content processing. Therefore, further steps in this direction are associated with the creation, among other things, of methods for automated purposeful manipulation of texts, taking into account their content. The analysis of works devoted to the study of the problems of formal presentation of texts and their subsequent use is carried out. Despite a number of successful projects, the challenges of solving the problem of the relationship between the content of the text and its meaning remain relevant. It seems that formalization of a General-purpose text while preserving its semantics is not feasible at this stage. However, there are types of texts that can be formalized while preserving their semantics. One of them is a regulatory text type, which is essentially a verbally expressed algorithm for a sequence of targeted actions. It is distinguished by logic and accuracy (lack of allegories), coherence and integrity, clarity, understandability (due to the lack of emotional coloring and figurative means), accessibility (due to the use of specific terminology). In other words, when developing regulatory texts, they usually try to display the mechanisms of the described actions as clearly as possible. Purpose: development of a method for formalizing a regulatory text while preserving its semantics. Methods: structural linguistics, representation of objects in the form of an ontology, constructive algorithms. The use of this method is demonstrated by describing the solution of a system of algebraic equations. Results: method for constructing a mathematical model of a regulatory text. Practical relevance: the application of the developed method makes it possible to develop software systems for building libraries of individual subject areas, develop tools for evaluating regulatory texts for their certainty, completeness, connectivity and other characteristics, as well as simulators and self-learning tools.
Keywords: regulatory text, artificial intelligence, mathematical model, constructive algorithm, ontology, frame.
Bibliographic databases:
Document Type: Article
UDC: 681.518 + 658.511
Language: Russian
Citation: M. Voronov, V. Pimenov, “Formalization of regulatory texts”, Informatics and Automation, 20:3 (2021), 562–590
Citation in format AMSBIB
\Bibitem{VorPim21}
\by M.~Voronov, V.~Pimenov
\paper Formalization of regulatory texts
\jour Informatics and Automation
\yr 2021
\vol 20
\issue 3
\pages 562--590
\mathnet{http://mi.mathnet.ru/trspy1153}
\crossref{https://doi.org/10.15622/ia.2021.3.3}
\elib{https://elibrary.ru/item.asp?id=46276500}
Linking options:
  • https://www.mathnet.ru/eng/trspy1153
  • https://www.mathnet.ru/eng/trspy/v20/i3/p562
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Informatics and Automation
    Statistics & downloads:
    Abstract page:118
    Full-text PDF :114
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024