A Strong Local Consistency for Constraint Satisfaction
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Domain filtering consistencies
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Recently, efficient algorithms have been proposed to achieve arc- and path-consistency in constraint net-works. The best path-consistency algorithm proposed is PC-(516) which is a natural generalization of AC-6 to path-consistency independently proposed in [lo] for PC-5 and [3] for PC-6. Unfortunately, we have remarked that PC-{5/6}, though it is widely better than PC-4[6], was not very efficient in practice, specially for those classes of problems that require an important space to be run. So, we propose a new path-consistency algorithm called PC-8, the space complexity of which is O(n' d) but its time complexity is 0(n3d4) i.e. worse than that of PC-{ 516}. However, the simplicity of PC-8 as well as the data structures used for its implementation offer a higher performance than PC-(516). The principle of PC-8 is also used to propose a new algorithm to achieve arc-consistency called AC-8.