Clique inference process for solving Max-CSP

Authors:
Mohand Ou Idir Khemmoudj;Hachemi Bennaceur
Affiliations:
LIPN-CNRS UMR 7030, Villetaneuse, France;LIPN-CNRS UMR 7030, Villetaneuse, France
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 6
Cited 1

Maintaining reversible DAC for Max-CSP

Artificial Intelligence
Partition-Based Lower Bound for Max-CSP

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Directed Arc Consistency Preprocessing

Constraint Processing, Selected Papers
Solving weighted CSP by maintaining arc consistency

Artificial Intelligence
In the quest of the best form of local consistency for weighted CSP

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Valid inequality based lower bounds for WCSP

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

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.