Maximum predicate descriptions of sets of mappings

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)1570-1581
Number of pages12
JournalComputational Mathematics and Mathematical Physics
Volume47
Issue number9
DOIs
Publication statusPublished - Sep 2007
Externally publishedYes

Fingerprint

Predicate
Betweenness
Algebraic Approach
Partial Order
Axioms
Imply
Necessary Conditions
Necessary
Sufficient Conditions

Keywords

  • Algebraic approach
  • Pattern recognition
  • Precedent learning
  • Predicate description

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Maximum predicate descriptions of sets of mappings. / Takhanov, R. S.

In: Computational Mathematics and Mathematical Physics, Vol. 47, No. 9, 09.2007, p. 1570-1581.

Research output: Contribution to journalArticle

@article{2da711ec2e7f451cb54a400bc9f0de46,
title = "Maximum predicate descriptions of sets of mappings",
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.",
keywords = "Algebraic approach, Pattern recognition, Precedent learning, Predicate description",
author = "Takhanov, {R. S.}",
year = "2007",
month = "9",
doi = "10.1134/S0965542507090175",
language = "English",
volume = "47",
pages = "1570--1581",
journal = "Computational Mathematics and Mathematical Physics",
issn = "0965-5425",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "9",

}

TY - JOUR

T1 - Maximum predicate descriptions of sets of mappings

AU - Takhanov, R. S.

PY - 2007/9

Y1 - 2007/9

N2 - 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.

AB - 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.

KW - Algebraic approach

KW - Pattern recognition

KW - Precedent learning

KW - Predicate description

UR - http://www.scopus.com/inward/record.url?scp=34848911013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34848911013&partnerID=8YFLogxK

U2 - 10.1134/S0965542507090175

DO - 10.1134/S0965542507090175

M3 - Article

VL - 47

SP - 1570

EP - 1581

JO - Computational Mathematics and Mathematical Physics

JF - Computational Mathematics and Mathematical Physics

SN - 0965-5425

IS - 9

ER -