PL EN


2008 | 14(27) | 171-182
Article title

FINITE PREDICATES WITH APPLICATIONS IN PATTERN RECOGNITION PROBLEMS

Selected contents from this journal
Title variants
Languages of publication
EN
Abstracts
EN
We extend the theory of Boolean functions, especially in respect to representing these functions in the disjunctive or conjunctive normal forms, onto the case of finite predicates. So, we show that it is useful to apply the language of Boolean vectors and matrices, developing efficient methods for calculation over finite predicates. This means that finite predicates should be decomposed into some binary units, which will correspond to components of Boolean vectors and matrices and should be represented as combinations of these units. Further, we define probabilities in data bases using Boolean matrices representing finite predicates. We also show that it is natural to try and present knowledge in the most compact form, which allows reducing the time of inference, by which the recognition problems are solved.
Year
Issue
Pages
171-182
Physical description
Document type
ARTICLE
Contributors
  • Arkady D. Zakrevskij, Corresponding Member of the National Academy of Sciences of Belarus, United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus
References
Document Type
Publication order reference
Identifiers
CEJSH db identifier
11PLAAAA101417
YADDA identifier
bwmeta1.element.5f2685c9-1e65-3c40-92bd-be1a197d8f5e
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.