Matrix-Like Structures in Solution of Constraint Satisfaction Problems
Alexander A. Zuenko · 2018 3rd Russian-Pacific Conference on Computer Technology and Applications (RPC) · 2018
The paper presents two types of matrix-like structures, the C-systems and the D-systems, which are proposed to be used in representation and handling the constraints over finite domains. The modifications of the well known constraints propagation algorithms have been developed by the author. The proposed approach allows representing the n-ary relations in a compressed form, and accelerating searching the solution by means of analyzing the specific features of the constraints matrices.