Arc and path consistence revisited
Artificial Intelligence
Arc consistency for factorable relations
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
An efficient arc consistency algorithm for a class of CSP problems
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
International Journal of Applied Mathematics and Computer Science
| Hi-index | 0.00 |
Constraint networks are known as a useful way to formulate problems such as design, scene labeling, temporal reasoning, and more recently natural language parsing. The problem of the existence of solutions in a constraint network is NP-complete. Hence, consistency techniques have been widely studied to simplify constraint networks before or during the search of solutions. Arc-consistency is the most used of them. Mohr and Henderson [Moh&Hen86] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often replace AC-4 by AC-3 [Mac&Fre85], a nonoptimal algorithm. In this paper, we propose a new algorithm, AC-6, which keeps the optimal worst-case time complexity of AC-4 while working out the drawback of space complexity. More, the average time complexity of AC-6 is optimal for constraint networks where nothing is known about the semantic of the constraints. At the end of the paper, experimental results show how much AC-6 outperforms AC-3 and AC-4.