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.
This work is supported in part by the French Electricity Board (EDF).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Affane, M.S., Bennaceur, H.: A Weighted Arc Consistency Technique for MAX-CSP. In: ECAI, pp. 209–213 (1998)
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)
Khemmoudj, M.I., Bennaceur, H.: Clique Based Lower Bounds for Max-CSP. Technical report 2006-02, LIPN (2006)
Larrosa, J., Meseguer, P., Schiex, T.: Maintening Reversible DAC for Max-CSP. Artificial Intelligence 107(1), 149–163 (1999)
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)
Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. In: IJCAI, pp. 239–244 (2003)
Larrosa, J., Schiex, T.: Solving Weighted CSP by Maintaining arc consistency. Artificial Intelligence 159(1-2), 1–26 (2004)
Wallace, R.: Directed arc consistency preprocessing. In: Dans Meyer, M. (ed.) Constraint Processing. LNCS, vol. 923, pp. 121–137. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khemmoudj, M.O.I., Bennaceur, H. (2006). Clique Inference Process for Solving Max-CSP. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_63
Download citation
DOI: https://doi.org/10.1007/11889205_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)