A Decomposition Technique for Max-CSP

The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In this paper, inspired from the concept of inferred disjunctive constraints introduced by Freuder and Hubbe, we show that it is possible to exploit the arc-inconsistency counts, associated with each value of a network, in order to avoid exploring useless portions of the search space. The principle is to reason from the distance between the two best values in the domain of a variable, according to such counts. From this reasoning, we can build a decomposition technique which can be used throughout search in order to decompose the current problem into easier sub-problems. Interestingly, this approach does not depend on the structure of the constraint graph, as it is usually proposed. Alternatively, we can dynamically post hard constraints that can be used locally to prune the search space. The practical interest o...

• Type: Conference
• Year: 2008
• Where: ECAI
• Authors: Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel
• Keywords: Artificial Intelligence, ECAI 2008, Inferred Disjunctive Constraints, Maximal Constraint Satisfaction, Search Space