Research output: Contribution to journal › Article › peer-review
The notion of partial deduction of a predicate formula from a set of atomic formulas without variables or their negations is introduced. Such a notion allows to solve various pattern recognition problems with incomplete description of a recognizable object. Algorithms based on partial deduction which solve such problems are constructed. These algorithms run upper bounds of step number are proved.
Original language | Russian |
---|---|
Pages (from-to) | 74-83 |
Journal | ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. СЕРИЯ 10: ПРИКЛАДНАЯ МАТЕМАТИКА, ИНФОРМАТИКА, ПРОЦЕССЫ УПРАВЛЕНИЯ |
Issue number | 1 |
State | Published - 2009 |
ID: 5161400