Comments on Mohr and Henderson's Path Consistency Algorithm
暂无分享,去创建一个
Mohr and Henderson have presented new algorithms for arc and path consistency in [1]. Though the underlying ideas of their algorithms are correct, the path consistency algorithm PC-3 is in error. In this paper we point out the errors in this algorithm and give a correct one. The time complexity and space complexity of the revised algorithm are also analyzed.
[1] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[2] Eugene C. Freuder,et al. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..
[3] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[4] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..