Advertisement

Clique Inference Process for Solving Max-CSP

  • Mohand Ou Idir Khemmoudj
  • Hachemi Bennaceur
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)

Abstract

In this paper we show that the clique concept can be exploited in order to solve Max-CSP. We present a clique inference process which leads to construct linear systems useful for computing new lower bounds. The clique inference process is introduced in the PFC-MPRDAC[5] algorithm and the obtained algorithm is called PFC-MPRDAC+CBB (CBB for Clique Based Bound). The carried out experiments have shown that PFC-MPRDAC+CBB leads to obtain very encouraging results.

Keywords

Constraint Satisfaction Problem Lagrangean Relaxation Local Consistency Binary Constraint Dual Lagrangean Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mohand Ou Idir Khemmoudj
    • 1
  • Hachemi Bennaceur
    • 1
  1. 1.LIPN-CNRS UMR 7030VilletaneuseFrance

Personalised recommendations