A decomposition technique for max-CSP

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 500-504

  Bennaceur, Hachémi ^b   Lecoutre, Christophe ^b   Roussel, Olivier ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS;

BEST VALUE; CONSTRAINT GRAPH; CONSTRAINT NETWORKS; CONSTRAINT VIOLATION; CURRENT PROBLEMS; DECOMPOSITION TECHNIQUE; DISJUNCTIVE CONSTRAINTS; MAXIMAL CONSTRAINT SATISFACTION PROBLEMS; SEARCH SPACES; SUB-PROBLEMS;

BRANCH AND BOUND METHOD;

EID: 84886024568     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-500     Document Type: Conference Paper

References (14)

1. M.S. Affane and H. Bennaceur, ‘A weighted arc-consistency technique for Max-CSP’, in Proceedings of ECAI’98, pp. 209–213, (1998).
2. M.C. Cooper, S. de Givry, and T. Schiex, ‘Optimal Soft Arc Consistency’, in Proceedings of IJCAI’07, pp. 68–73, (2007).
3. M.C. Cooper and T. Schiex, ‘Arc consistency for soft constraints’, Artificial Intelligence, 154(1-2), 199–227, (2004).
4. S. de Givry, F. Heras, M. Zytnicki, and J. Larrosa, ‘Existential arc consistency: Getting closer to full arc consistency in weighted CSPs’, in Proceedings of IJCAI’05, pp. 84–89, (2005).
5. S. de Givry, T. Schiex, and G. Verfaillie, ‘Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP’, in Proceedings of AAAI’06, (2006).
6. E.C. Freuder and P.D. Hubbe, ‘Using inferred disjunctive constraints to decompose constraint satisfaction problems’, in Proceedings of IJCAI’93, pp. 254–261, (1993).
7. E.C. Freuder and R.J. Wallace, ‘Partial constraint satisfaction’, Artificial Intelligence, 58(1-3), 21–70, (1992).
8. P. Jégou and C. Terrioux, ‘Hybrid backtracking bounded by tree-decomposition of constraint networks’, Artificial Intelligence, 146(1), 43–75, (2003).
9. J. Larrosa and R. Dechter, ‘Boosting search with variable elimination in constraint optimization and constraint satisfaction problems’, Constraints, 8(3), 303–326, (2003).
10. J. Larrosa and P. Meseguer, ‘Partition-Based lower bound for Max-CSP’, Constraints, 7, 407–419, (2002).
11. J. Larrosa, P. Meseguer, and T. Schiex, ‘Maintaining reversible DAC for Max-CSP’, Artificial Intelligence, 107(1), 149–163, (1999).
12. R. Marinescu and R. Dechter, ‘AND/OR Branch-and-Bound for Graphical Models’, in Proceedings of IJCAI’05, pp. 224–229, (2005).
13. J.C. Regin, T. Petit, C. Bessiere, and J.F. Puget, ‘New lower bounds of constraint violations for over-constrained problems’, in Proceedings of CP’01, pp. 332–345, (2001).
14. G. Verfaillie, M. Lemaitre, and T. Schiex, ‘Russian doll search for solving constraint optimization problems’, in Proceedings of AAAI’96, pp. 181–187, (1996).