Constraint inference based on the matrix representation of finite predicates

This paper proposes methods of constraint inference and heuristic search for solving constraint satisfaction problems with the variables defined on finite domains. The developed methods use the matrix representation of finite predicates which allow to not convert constraints into binary relations and implement an effective reduction of the search space.