A Class of Constraint Satisfaction Problems and Its Algorithms
Jiang Ben-tie, BI Shi-fei · Journal of Northeastern University · 2003
?A new definition is put forward to a class of constraint satisfaction problems(CSP) in form of analytic constraints with multi-assignment to single variable. Based on the new definition, a series of concepts and 3 algorithms, i.e, the integer programming, inequility set and direct solution to indefinite equation, are set up through analyzing a particalar type of CSP, of which the 3rd algorithm is discussed in detail with its time complexity in worst case presented. Thus, the general analysis procedure of a class of CSPs can be described clearly to reveal the relation between CSP and classical integer programming,number theory and integer ring theory.