4. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier.

The Constraint Logic Programming Language CHIP. In **Proceedings of FGCS-88**,
pages 693–702, 1988.

5. E. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proceedings of AAAI-91**, pages 227–233, 1991.**
6. P. A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems.

In Proceedings of ECAI-92**, pages 31–35, 1992.**
7. A. Haselbock. Exploiting interchangeabilities in constraint satisfaction problems.

In Proceedings of IJCAI-93**, pages 282–287, 1993.**
8. J. Hwang and D. Mitchell. 2-Way vs. d-Way Branching for CSP. In **Proceedings**
of CP-2005**, pages 343–357, 2005.**
9. M. Kitching and F. Bacchus. Set Branching in Constraint Optimization. In Proceedings of IJCAI-09**, pages 532–537, 2009.**
10. J. Larrosa. Merging constraint satisfaction problems to avoid redundant search.

In Proceedings of IJCAI-97**, pages 424–433, 1997.**
11. V. Park. An empirical study of different branching strategies for constraint satisfaction problems, Master's thesis, University of London, 2004.

12. D. Pelleg and A. Moore. X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In Proceedings of ICML-2000**, pages 727–734, 2000.**
13. S. Prestwich. Full Dynamic Interchangeability with Forward Checking and Arc Consistency. In Proceedings of the ECAI Workshop on Modeling and Solving Problems With Constraints**, 2004.**
14. D. Sabin and E.C. Freuder. Understanding and Improving the MAC Algorithm.

In Proceedings of CP-1997**, pages 167–181, 1997.**
15. M. Silaghi, D. Sam-Haroud, and B. Faltings. Intelligent **Domain Splitting for CSPs**
with Ordered Domains. In Proceedings of CP-99**, pages 488–489, 1999.**
16. B. Smith and P. Sturdy. Value Ordering for Finding All Solutions. In **Proceedings**
of IJCAI-05**, pages 311–316, 2005.**
17. J. van Hoeve and M. Milano. Postponing Branching Decisions. In **Proceedings of**
ECAI-04, pages 1105–1106, 2004.