Decomposition and good recording for solving Max-CSPs

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 196-200

  Philippe, Jégou ^a   Cyril, Terrioux ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

COMPLEXITY BOUNDS; ENUMERATIVE METHOD; OPTIMAL COSTS; OPTIMAL SOLUTIONS; REAL-WORLD; TIME COMPLEXITY; TREE DECOMPOSITION;

OPTIMAL SYSTEMS;

EID: 85017406004     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. S. Arnborg, D. Corneil, and A. Proskurowski, 'Complexity of finding embeddings in a k-tree', SIAM Journal of Discrete Mathematics, 8, 277-284, (1987).
2. S. Bistarelli, U. Montanari, and F. Rossi, 'Constraint solving over semirings', in Proc. of IJCAI, pp. 624-630, (1995).
3. C. Cabon, S. de Givry, L. Lobjois, T. Schiex, and J. P. Warners, 'Radio Link Frequency Assignment', Constraints, 4, 79-89, (1999).
4. M. Cooper and T. Schiex, 'Arc consistency for soft constraints', Artificial Intelligence, 154, 199-227, (2004).
5. R. Dechter and Y. El Fattah, 'Topological Parameters for Time-Space Tradeoff', Artificial Intelligence, 125, 93-118, (2001).
6. E. Freuder and R. Wallace, 'Partial constraint satisfaction', Artificial Intelligence, 58, 21-70, (1992).
7. P. Jegou and C. Terrioux, Hybrid backtracking bounded by treedecomposition of constraint networks, Artificial Intelligence, 146, 43- 75, (2003).
8. A. Koster, Frequency Assignment - Models and Algorithms, Ph.D. dissertation, University of Maastricht, November 1999.
9. J. Larrosa. http://www.lsi.upc.es/larrosa/pfc-mrdac.
10. J. Larrosa, On arc and node consistency, in Proc. of AAAI, pp. 48-53, (2002).
11. J. Larrosa and R. Dechter, 'Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems', Constraints, 8(3), 303-326, (2003).
12. J. Larrosa, P. Meseguer, and M. Śanchez, 'Pseudo-Tree Search with Soft Constraints', in Proc. of ECAI, pp. 131-135, (2002).
13. J. Larrosa, P. Meseguer, and T. Schiex, 'Maintaining reversible DAC for Max-CSP', Artificial Intelligence, 107(1), 149-163, (1999).
14. J. Larrosa and T. Schiex, 'In the quest of the best form of local consistency for Weighted CSP', in Proc. of IJCAI, pp. 239-244, (2003).
15. P. Meseguer and M. Śanchez, 'Tree-based Russian Doll Search', in Proc. of CP Workshop on soft constraint, (2000).
16. P. Meseguer and M. Śanchez, 'Specializing Russian Doll Search', in Proc. of CP, pp. 464-478, (2001).
17. P. Meseguer, M. Śanchez, and G. Verfaillie, 'Opportunistic Specialization in Russian Doll Search', in Proc. of CP, pp. 264-279, (2002).
18. N. Robertson and P.D. Seymour, 'Graph minors II: Algorithmic aspects of tree-width', Algorithms, 7, 309-322, (1986).
19. D. Rose, R. Tarjan, and G. Lueker, 'Algorithmic Aspects of Vertex Elimination on Graphs', SIAM Journal on computing, 5, 266-283, (1976).
20. T. Schiex. http://www.inra.fr/bia/t/schiex/doc/celare.html.
21. T. Schiex, H. Fargier, and G. Verfaillie, 'Valued Constraint Satisfaction Problems: hard and easy problems', in Proc. of IJCAI, pp. 631-637, (1995).
22. C. Terrioux and P. Jegou, Bounded backtracking for the valued constraint satisfaction problems, in Proc. of CP, pp. 709-723, (2003).
23. G. Verfaillie, M. Lemâitre, and T. Schiex, 'Russian Doll Search for Solving Constraint Optimization Problems', in Proc. of AAAI, pp. 181- 187, (1996).