A Domain Decomposition Algorithm for Constraint Satisfaction

ACM Journal of Experimental Algorithmics

Volumn 13, Issue , 2009, Pages 1.13-1.23

  Naanaa, Wady ^a  

^a UNIVERSITY OF MONASTIR   (Tunisia)

Author keywords

Algorithms; Constraint graph orientation; constraint satisfaction problems; domain decomposition algorithms; Experimentation; Performance; value substitutability

Indexed keywords

EID: 84999330538     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/1412228.1455269     Document Type: Article

References (26)

1. Boussemart, F., Hemery, F., Lecoutre, C., and Sais, L. 2004. Boosting systematic search by weighting constraints. In Proceedings of ECAI’04. 146-150.
2. Bowen, J. and Likitvivatanavong, C. 2004. Domain transmutation in constraint satisfaction problems. In Proceedings of AAAI’04. 149-154.
3. Cabon, B., Givry, S. D., Lobjois, L., Schiex, T., and J. P. W. 1999. Radio link frequency assignment. Constraints 4, 1, 79-89.
4. Choueiry, B. Y. and Davis, A. M. 2002. Dynamic bundling: less effort for more solutions. In Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation, Lecture Notes in Computer Science. Vol. 2371. Springer-Verlag, 64-82.
5. Dilworth, R. P. 1950. A decomposition theorem for partially ordered sets. Annals of Mathematics 51, 161-166.
6. Ford, L. R. and Fulkerson, D. R. 1962. Flows in Networks. Princeton University Press.
7. Freuder, E. C. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI’91. 227-233.
8. Frost, D. and Dechter, R. 1995. Look-ahead value ordering for constraint satisfaction problems. In Proceedings of IJCAI’95. 572-578.
9. Grant, S. A. 1997. Phase transition behaviour in constraint satisfaction problems. Ph. D. thesis, University of Leeds, Leeds, U. K.
10. Haralick, R. and Elliot, G. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263-313.
11. Hopcroft, J. E. and Karp, R. M. 1993. An [formula ommit] algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing 2, 4, 225-231.
12. Hubbe, P. D. and Freuder, E. C. 1992. An efficient cross product representation of the constraint satisfaction problem search space. In Proceedings of the 10th National Conference on Artificial Intelligence. San Jose, California, USA, 421-427.
13. Jeavons, P. G., Cohen, D. A., and Cooper, M. C. 1994. A substitution operation for constraints. In Proceedings of the 2nd International Workshop on Principal and Proctice of Constraint Programming (PPCP’94), Lecture Notes in Computer Science. Vol. 874. Springer-Verlag, 1-9.
14. Jensen, T. and Toft, B. 1995. Graph Coloring Problems. Wiley.
15. Lal, A., Choueiry, B. Y., and Freuder, E. C. 2005. Neighborhood interchangeability and dynamic bundling for non-binary finite csps. In Proceedings of AAAI’05. 397-404.
16. Lecoutre, C. 2007. Toward benchmarks 2.1. xml representation of csp instances. http://www. cril.univ-artois.fr/~ lecoutre/research/benchmarks/benchmarks.html.
17. Lesaint, D. 1994. Maximal sets of solutions for constraint satisfaction problems. In Proceedings of the 11th European Conference on Artificial Intelligence. Amsterdam, The Netherlands, 110-114.
18. Mackworth, A. K. 1977. Consistency in networks of relations. Artificial Intelligence 8, 99-118.
19. Naanaa, W. 2007. Directional interchangeability for enhancing cspsolving. In Proceedings of CPAIOR’07, Hentenryck and Wolsey, Eds. Lecture Notes in Computer Science. Vol. 4510. Springer-Verlag, 200-213.
20. Neagu, N., Bistarelli, S., and Faltings, B. V. 2003. Experimental evaluation of interchangeability in soft csps. In Proceedings of the International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP). 140-153.
21. Sabin, D. and Freuder, E. C. 1994. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the 11th European Conference on Artificial Intelligence. Amsterdam, The Netherlands, 124-129.
22. Silaghi, M. C., Sam-Haroud, D., and Faltings, B. V. 2000. Ways of maintaining arc-consistency in search using the cartesian representation. In New Trends in Constraints, Joint ERCIM/Compulog Net Workshop. Springer-Verlag, 173-187.
23. Taillard, E. 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278-285.
24. Trick, M. 2003. Graph coloring and its generalisations. http://mat.gsia.cmu.edu/COLORING03.
25. Xu, K. and Li, W. 2000. Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research 12, 93-103.
26. Zhang, Y. and Freuder, E. C. 2004. Conditional interchangeability and substitutability. In Proceedings of the 4th International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon’04). Toronto, Canada, 95-100.