Notional Model of Knowledge

This article discusses well-known methods of knowledge representation and processing. A new model, called notional, is proposed, characterized in that the relations (links) between notions are considered as ordinary notions. The notion is considered as a form of thought expressed by a named set of entities. A specific notion identifies one entity. An abstract notion is formed from other notions by generalization (union) and association (Cartesian product) them. Declarative knowledge is given by enumerable sets of entities, and procedural knowledge is given by solvable ones, where resolving procedures are expressed by formulas of the pure monadic predicate calculus. The description of the applied language of knowledge representation and processing is given. It is proven that queries to the notional model are executed in polynomial time from the logarithm of the average number of entities in notions. The possibility of unsupervised learning of notional models is substantiated. It is shown that the notional model makes it possible to visually represent and effectively process both declarative and procedural knowledge.

Authors

Institutions

Publication Details

Journal
Scientific and Technical Information Processing
Published
2025-12-01
DOI
https://doi.org/10.3103/s0147688225700467
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Notional Model of Knowledge

V. S. Vykhovanets
Scientific and Technical Information Processing
Logic, Reasoning, and Knowledge
article

Notional Model of Knowledge

V. S. Vykhovanets
article en

Abstract

This article discusses well-known methods of knowledge representation and processing. A new model, called notional, is proposed, characterized in that the relations (links) between notions are considered as ordinary notions. The notion is considered as a form of thought expressed by a named set of entities. A specific notion identifies one entity. An abstract notion is formed from other notions by generalization (union) and association (Cartesian product) them. Declarative knowledge is given by enumerable sets of entities, and procedural knowledge is given by solvable ones, where resolving procedures are expressed by formulas of the pure monadic predicate calculus. The description of the applied language of knowledge representation and processing is given. It is proven that queries to the notional model are executed in polynomial time from the logarithm of the average number of entities in notions. The possibility of unsupervised learning of notional models is substantiated. It is shown that the notional model makes it possible to visually represent and effectively process both declarative and procedural knowledge.

Scientific and Technical Information ProcessingVol. 52(6)
Bauman Moscow State Technical University (RU)
Peace, Justice and strong institutions
Openalex Percentile: Top 14%
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.