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
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
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Exploiting interchangeabilities in constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Abstraction via approximate symmetry
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Abstraction by interchangeability in resource allocation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A domain decomposition algorithm for constraint satisfaction
Journal of Experimental Algorithmics (JEA)
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
Compositional derivation of symmetries for constraint satisfaction
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
| Hi-index | 0.00 |
Bundling of the values of variables in a Constraint Satisfaction Problem (CSP) as the search proceeds is an abstraction mechanism that yields a compact representation of the solution space. We have previously established that, in spite of the effort of recomputing the bundles, dynamic bundling is never less effective than static bundling and nonbundling search strategies. Objections were raised that bundling mechanisms (whether static or dynamic) are too costly and not worthwhile when one is not seeking all solutions to the CSP. In this paper, we dispel these doubts and empirically show that (1) dynamic bundling remains superior in this context, (2) it does not require a full lookahead strategy, and (3) it dramatically reduces the cost of solving problems at the phase transition while yielding a bundle of multiple, robust solutions.