Clique inference process for solving Max-CSP

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

Volumn 4204 LNCS, Issue , 2006, Pages 746-750

  Khemmoudj, Mohand Ou Idir ^a   Bennaceur, Hachemi ^a  

^a Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

CLIQUE BASED BOUND (CBB); CLIQUE INFERENCE PROCESS;

CONSTRAINT THEORY;

EID: 33750338632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_63     Document Type: Conference Paper

References (8)

1. Affane, M.S., Bennaceur, H.: A Weighted Arc Consistency Technique for MAX-CSP, ECAI (1998) 209-213.
2. de Givry, S., Zytnicki, M., Heras, F., Larrosa, J.: Existential arc consistency: Getting closer to full arc consistency in weighted csps. IJCAI (2005) 84-89.
3. Khemmoudj, M.I., Bennaceur, H.: Clique Based Lower Bounds for Max-CSP.Technical report 2006-02, LIPN (2006).
4. Larrosa, J., Meseguer, P., Schiex, T.: Maintening Reversible DAC for Max-CSP. Artificial Intelligence 107(1), (1999) 149-163.
5. Larrosa, J., Meseguer, P.: Partition-Based Lower Bound for Max-CSP. CP (1999) 303-315.
6. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. IJCAI (2003) 239-244.
7. Larrosa, J., Schiex, T.: Solving Weighted CSP by Maintaining arc consistency. Artificial Intelligence 159(1-2), (2004) 1-26.
8. Wallace, R.: Directed arc consistency preprocessing. Dans Meyer,M., ed., Selected papers from the ECAI Workshop on Constraint Processing, 923 dans LNCS. Berlin: Springer. (1994) 121-137.