由声明给出的部分定义泛函神经网络解的若干方法

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
V. N. Betin, V. A. Ivashchenko, A. P. Suprun
{"title":"由声明给出的部分定义泛函神经网络解的若干方法","authors":"V. N. Betin,&nbsp;V. A. Ivashchenko,&nbsp;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,&nbsp;V. A. Ivashchenko,&nbsp;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}
引用次数: 0

摘要

本文考虑了一种求解泛函神经网络(FN-networks)形式的算法的特征,其中初始问题的知识库和描述包含由具有规则结构的部分定义的fn -网络定义的概念,这些概念以相同类型的对象和相同结构的片段的集合的枚举形式定义,当它们的数量是未知的并且可能是无限的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Some Methods for Finding a Solution in Partially Defined Functional Neural Networks Given by Declarations

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
AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS COMPUTER SCIENCE, INFORMATION SYSTEMS-
自引率
40.00%
发文量
18
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信