INFORMATICS

Programming limits

U. M. Bishenov, T. Kh. Ivanov

Institute of Computer Science and Problems of Regional Management of KBSC of RAS, Nal'chik

Abstract: 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

UDC: 519.717