Criteria for the completeness of algorithms for fuzzy marking
The author studies the synthesis of adaptive algorithms for classification of points in plane configurations. The modified problem is based upon metrics for the neighborhood comparison and introduction of a continuous set of marks. Solvability criteria are given as well as completeness criteria for a family of solving rules.
scientific article; zbMATH DE number 6183499