{"title":"由声明给出的部分定义泛函神经网络解的若干方法","authors":"V. N. Betin, V. A. Ivashchenko, A. P. Suprun","doi":"10.3103/S0005105525700542","DOIUrl":null,"url":null,"abstract":"<p>The paper considers the features of an algorithm for finding a solution in the formalism of functional neural networks (FN-networks), where the knowledge base and description of the initial problem contain concepts that are defined by partially defined FN-networks with a regular structure, in the form of enumerations of sets of the same type of objects and fragments of the same structure, when their number is unknown and possibly infinite.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":"59 2","pages":"98 - 108"},"PeriodicalIF":0.5000,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some Methods for Finding a Solution in Partially Defined Functional Neural Networks Given by Declarations\",\"authors\":\"V. N. Betin, V. A. Ivashchenko, A. P. Suprun\",\"doi\":\"10.3103/S0005105525700542\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The paper considers the features of an algorithm for finding a solution in the formalism of functional neural networks (FN-networks), where the knowledge base and description of the initial problem contain concepts that are defined by partially defined FN-networks with a regular structure, in the form of enumerations of sets of the same type of objects and fragments of the same structure, when their number is unknown and possibly infinite.</p>\",\"PeriodicalId\":42995,\"journal\":{\"name\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"volume\":\"59 2\",\"pages\":\"98 - 108\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0005105525700542\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105525700542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Some Methods for Finding a Solution in Partially Defined Functional Neural Networks Given by Declarations
The paper considers the features of an algorithm for finding a solution in the formalism of functional neural networks (FN-networks), where the knowledge base and description of the initial problem contain concepts that are defined by partially defined FN-networks with a regular structure, in the form of enumerations of sets of the same type of objects and fragments of the same structure, when their number is unknown and possibly infinite.
期刊介绍:
Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.