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 fo...

Full description

Saved in:
Bibliographic Details
Published inAutomatic documentation and mathematical linguistics Vol. 59; no. 2; pp. 98 - 108
Main Authors Betin, V. N., Ivashchenko, V. A., Suprun, A. P.
Format Journal Article
LanguageEnglish
Published Moscow Pleiades Publishing 01.04.2025
Springer Nature B.V
Subjects
Computer Science
Information Analysis
Information Storage and Retrieval
Knowledge bases (artificial intelligence)
Neural networks
information-analytic systems
consolidation of knowledge
knowledge bases
automated decision making
semantic data processing
inferencing machinery
automated algorithm synthesis
FN-network
text comprehension systems
artificial intelligence
decision support systems
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0005-1055
1934-8371
DOI:10.3103/S0005105525700542