This article is cited in 1 paper

Maximum predicate descriptions of sets of mappings

R. S. Takhanov

Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, Russia

Abstract: The work is carried out in the framework of the algebraic approach and is devoted to the problem of describing sets of mappings by pairs of m-place predicates. Maximum descriptions are distinguished in the set of all predicate descriptions, and necessary and sufficient maximality conditions are obtained. Using a partial order and betweenness relations as examples, it is shown that, for a given predicate on the set of values, the necessary maximality conditions imply some properties of this predicate on its domain. Taking this fact into account, a set of axioms for the betweenness relation is proposed, and examples of such relations are considered.

Key words: predicate description, precedent learning, pattern recognition, algebraic approach.

UDC: 519.71

Received: 07.10.2005
Revised: 05.04.2007

 English version: Computational Mathematics and Mathematical Physics, 2007, 47:9, 1570–1581

Bibliographic databases:

• 
•