Публікація:
Defining logic structures in functional spaces

dc.contributor.authorSitnikov, D.
dc.contributor.authorMatski, N.
dc.contributor.authorRyabov, O.
dc.date.accessioned2018-06-04T18:47:13Z
dc.date.available2018-06-04T18:47:13Z
dc.date.issued2007
dc.description.abstractMany practical problems of geometric information representation and pattern recognition require specific methods and tools for describing complex functions and geometric objects in a way that allows us to use such descriptions for making effective mathematical transformations and logic inferences. Since in real world situations we rarely encounter ideal objects that can be described with the help of one elementary function it is important to develop methods and models for integrating geometric information. There are some original approaches to describing complicated geometric structures, one of which is a method based on so-called R-functions. These functions allow complicated geometric objects to be described analytically, which gives an opportunity to operate with complex objects with the help of a single real function. The concept of R-functions is quite simple but the range of practical applications of this theory is very broad. In this paper we have suggested a generalization of R-functions, which we call Rp-functions. Any R-function can be associated with a Boolean function and it is always possible to construct an R-function corresponding to a given Boolean one. Similarly, any Rp-function can be associated with a finite predicate and it is always possible to construct an Rp-function corresponding to a given predicate. If R-functions allow us to use Boolean logic for describing complex objects, Rp-functions provide a possibility of using predicate logic, which is more rich and general than Boolean one. Like R-functions, Rp-functions allow the use of knowledge on what logic rules have been used for constructing a complex object to build a function which is positive inside the given domain and negative outside it. Rp-functions also seem to be interesting by themselves as they allow discovery of logic properties of quite a large class of real functions.uk_UA
dc.identifier.citationSitnikov D. Defining logic structures in functional spaces / D. Sitnikov, N. Matski, O. Ryabov // WIT Transactions on Information and Communication Technologies. – 2007. – V. 38. – P. 75-81.uk_UA
dc.identifier.urihttp://openarchive.nure.ua/handle/document/5788
dc.language.isoenuk_UA
dc.publisherWIT Transactions on Information and Communication Technologiesuk_UA
dc.subjectdata structuresuk_UA
dc.subjectfunctional analysisuk_UA
dc.subjectinformation analysisuk_UA
dc.subjectmathematical transformationsuk_UA
dc.subjectpattern recognitionuk_UA
dc.subjectproblem solvinguk_UA
dc.titleDefining logic structures in functional spacesuk_UA
dc.typeArticleuk_UA
dspace.entity.typePublication

Файли

Оригінальний пакет
Зараз показано 1 - 1 з 1
Завантаження...
Зображення мініатюри
Назва:
Ситников-DLSFS-2007.pdf
Розмір:
236.9 KB
Формат:
Adobe Portable Document Format
Ліцензійний пакет
Зараз показано 1 - 1 з 1
Немає доступних мініатюр
Назва:
license.txt
Розмір:
9.42 KB
Формат:
Item-specific license agreed upon to submission
Опис: