Completeness criteria for classification problems with set-theoretic constraints
    
    
  
  
  
      
      
      
        
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 2, pp. 344-353
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              Within the framework of the algebraic approach to the synthesis of correct algorithms, a class of problems is described and analyzed in which, for each element of the initial-information space, a corresponding subset of the final-information set (problems with set-theoretic constraints) is defined. The concept of completeness is introduced for models of algorithms and algorithmic operators and for decision rule classes and correcting operations. Relevant completeness criteria are derived and proved.
            
            
            
          
        
      @article{ZVMMF_2005_45_2_a16,
     author = {K. V. Rudakov and Yu. V. Chekhovich},
     title = {Completeness criteria for classification problems with set-theoretic constraints},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {344--353},
     publisher = {mathdoc},
     volume = {45},
     number = {2},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a16/}
}
                      
                      
                    TY - JOUR AU - K. V. Rudakov AU - Yu. V. Chekhovich TI - Completeness criteria for classification problems with set-theoretic constraints JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2005 SP - 344 EP - 353 VL - 45 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a16/ LA - ru ID - ZVMMF_2005_45_2_a16 ER -
%0 Journal Article %A K. V. Rudakov %A Yu. V. Chekhovich %T Completeness criteria for classification problems with set-theoretic constraints %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 2005 %P 344-353 %V 45 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a16/ %G ru %F ZVMMF_2005_45_2_a16
K. V. Rudakov; Yu. V. Chekhovich. Completeness criteria for classification problems with set-theoretic constraints. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 2, pp. 344-353. http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_2_a16/
