Radio Link Frequency Assignment
Constraints
A Substitution Operation for Constraints
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Dynamic Bundling: Less Effort for More Solutions
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Domain transmutation in constraint satisfaction problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Concurrently decomposable constraint systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Optimal temporal decoupling in multiagent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Decomposing constraint systems: equivalences and computational properties
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Modularity-based decompositions for valued CSP
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
This article presents a domain decomposition algorithm for solving constraint satisfactions problems (CSPs). The proposed algorithm relies on a weak form of neighborhood substitutability referred to as directional substitutability. The main idea is that although two values may not be neighborhood substitutable if we consider the whole neighborhood of a given variable, they could be substitutable if we only focus on a part of the neighborhood induced by an orientation of the constraint graph. Directional substitutability provides a mean to decompose value domains into chains of directionally substitutable values that can be attempted simultaneously during search. We report experiments carried out on several binary CSPs which clearly indicate that variations of classical algorithms which exploit directional substitutability often outperform the original algorithms.