约束满足问题中一致性算法的分析与研究

THE ANALYSIS AND RESEARCH OF CONSISTENCY ALGORITHM IN CSP

约束满足问题是人工智能领域的重要研究方向,其求解方法有三种,搜索、一致性算法和约束传播,其中一致性算法通常通过缩减问题域来提高搜索算法的效率。着重介绍了几种常用的一致性算法,并对几种常用算法进行了分析、比较和研究。

Constraint Satisfaction Problems （CSP） have been an improtant subject in Artificial Intelligence. There are three methods to solve CSP：systematic search algorithm, consistency techniques, and constraint propagation. Consistency techniques are usually used to improve the search efficiency by wiping out the search domain. Some consistency algorithms are introduced, and some different algorithms are discussed and compared.