Directional interchangeability for enhancing CSP solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4510 LNCS, Issue , 2007, Pages 200-213

  Naanaa, Wady ^a  

^a FACULTÉ DES SCIENCES DE MONASTIR   (Tunisia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; CONSTRAINT THEORY; FUNCTION EVALUATION; PROBLEM SOLVING;

CONSTRAINT SATISFIABILITY PROBLEMS (CSP); DIRECTIONAL INTERCHANGEABILITY; FORWARD CHECKING ALGORITHM;

COMPUTATIONAL METHODS;

EID: 37149009999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72397-4_15     Document Type: Conference Paper

References (16)

1. Frost, D., Bessière, C., Dechter, R., Régin, J.C.: Random uniform CSP generators. http://www.lirmm.fr/~bessiere/generator.html.
2. Bowen J., Likitvivatanavong, C.: Domain transmutation in constraint satisfaction problems. Proceedings of AAAI-04 2004.
3. Cabon, B., De Givry, S., Lobjois, L. Schiex, T., Warners, J. P.: Radio link frequency assignement. Constraints 4 (1) 79-89.
4. http://www.cril.univ-artois.fr/lecoutre/research/benchmarks/benchmarks. html.
5. Dechter, R., Pearl, J.: Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 (1988) 1-38.
6. Freuder, E. C.: Eliminating interchangeable values in constraint satisfaction problems. Proceedings of AAAI-91 (1991) 227-233.
7. Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-313.
8. th International Joint Conference On Artificial Intelligence (1995) 607-613.
9. Haselbock, A.: Exploiting interchangeability in constraint satisfaction problems. In Proceedings of IJCAI-93 (1993) 282-297.
10. Ginsberg, M.L., Parkes, A. J., Roy, A.: Super-model and robustness. Proceeding of AAAI-98 Madison Wisconsin 1998.
11. Lal, A., Choueiry, B.Y., Freuder, E.C.: Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs. Proceedings of AAAI-05 (2005) 397-404.
12. Sabin, D., Freuder, E.C: Contradicting conventional wisdom in constraint satisfaction. Proceedings of the 11th European Conference on Artificial Intelligence (1994).
13. Weigel R., Faltings, B. V.: Compiling constraint satisfaction problems. Artificial Intelligence 115 (2) 257-287.
14. Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285.
15. Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research 12 (2000) 93-103.
16. Zhang, Y., Freuder, E.C.: Conditional interchangeability and substitutability. Proceedings of Fourth International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon04) Toronto 2004.