Arc and path consistence revisited
Artificial Intelligence
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
Radio Link Frequency Assignment
Constraints
AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Domain-heuristics for arc-consistency algorithms
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Constraint satisfaction problems solved by semidefinite relaxations
WSEAS Transactions on Computers
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reducing checks and revisions in coarse-grained MAC algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Optimal implementation of watched literals and more general techniques
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Arc-consistency algorithms are the workhorse of backtrackers that maintain arc-consistency (MAC). This paper will provide experimental evidence that, despite common belief to the contrary, it is not always necessary for a good arc-consistency algorithm to have an optimal worst-case time-complexity. Sacrificing this optimality allows MAC solvers that (1) do not need additional data structures during search, (2) have an excellent average time-complexity, and (3) have a space-complexity that improves significantly on that of MAC solvers that have optimal arc-consistency components. Results will be presented from an experimental comparison between MAC-2001, MAC-3d and related algorithms. MAC-2001 has an arc-consistency component with an optimal worst-case time-complexity, whereas MAC-3d does not. MAC-2001 requires additional data structures during search, whereas MAC-3d does not. MAC-3d has a O(e+nd) of space-complexity, where n is the number of variables, d the maximum domain size, and e the number of constraints. We shall demonstrate that MAC-2001's space-complexity is O(edmin(n,d)). Our experimental results indicate that MAC-2001 was slower than MAC-3d for easy and hard random problems. For real-world problems things were not as clear.