Geodesic
Programming limits
News of the Kabardin-Balkar scientific center of RAS, no. 1 (2000), pp. 21-31 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper discusses methods and algorithms for solving combinatorially posed problems within a certain point of view. A new binarization method 3 is proposed that uses a partial solution (k-place relation) to accelerate progress toward solving the underlying problem. This idea is expressed very naturally in logical language.
Keywords: constraint programming, combinatorial problems, artificial intelligence, logical language, search 
@article{IZKAB_2000_1_a0,
     author = {U. M. Bishenov and T. Kh. Ivanov},
     title = {Programming limits},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {21--31},
     year = {2000},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_2000_1_a0/}
}
TY  - JOUR
AU  - U. M. Bishenov
AU  - T. Kh. Ivanov
TI  - Programming limits
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 2000
SP  - 21
EP  - 31
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/IZKAB_2000_1_a0/
LA  - ru
ID  - IZKAB_2000_1_a0
ER  - 
%0 Journal Article
%A U. M. Bishenov
%A T. Kh. Ivanov
%T Programming limits
%J News of the Kabardin-Balkar scientific center of RAS
%D 2000
%P 21-31
%N 1
%U http://geodesic.mathdoc.fr/item/IZKAB_2000_1_a0/
%G ru
%F IZKAB_2000_1_a0
U. M. Bishenov; T. Kh. Ivanov. Programming limits. News of the Kabardin-Balkar scientific center of RAS, no. 1 (2000), pp. 21-31. http://geodesic.mathdoc.fr/item/IZKAB_2000_1_a0/