Solving Non-Binary Constraint Satisfaction Problem
Sun Ji · Chinese Journal of Computers · 2003
Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary constraints appear quite frequently when modeling real problems. In this paper, on the basis of summarizing two kinds of approaches on solving non-binary CSPs, we study a non-binary CSP method which combines constraint propagation with GAC backtracking algorithm, and implement it in our Constraint Solving Platform “MingYue (1.0 version)”. For some typical examples, we also give experimental results.