Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
On the computation of local interchangeability in discrete constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Backtrack Searching in the Presence of Symmetry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Exploiting interchangeabilities in constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Abstraction and Reformulation in GraphPlan
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Dynamic Bundling: Less Effort for More Solutions
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
An Investigation of Variable Relationships in 3-SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Refutation Approach to Neighborhood Interchangeability in CSPs
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
We investigate how the performance of search for solving finite constraint satisfaction problems (CSPs) is affected by the level of interchangeability embedded in the problem. First, we describe a generator of random CSPs that allows us to control the level of interchangeability in an instance. Then we study how the varying level of interchangeability affects the performance of search for finding one solution and all solutions to the CSP. We conduct experiments using forward-checking search, extended with static and dynamic ordering heuristics in combination with non-bundling, static, and dynamic bundling strategies. We demonstrate that: (1) While the performance of bundling decreases in general with decreasing interchangeability, this effect is muted when finding a first solution. (2) Dynamic ordering strategies are significantly more resistant to this degradation than static ordering. (3) Dynamic bundling strategies perform overall significantly better than static bundling strategies. Even when finding one solution, the size of the bundles yielded by dynamic bundling is large and less sensitive to the level of interchangeability. (4) The combination of dynamic ordering heuristics with dynamic bundling is advantageous. We conclude that this combination, in addition to yielding the best results, is the least sensitive to the level of interchangeability, and thus, indeed is superior to other searches.