论文信息 - Perfect Constraints Are Tractable

Perfect Constraints Are Tractable

By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. These include problems with chordal microstructure; problems with chordal microstructure complement; problems with tree structure; and the "all-different" constraint. In each of these cases we show that the associated microstructure of the problem is a perfect graph, and hence they are all part of the same larger family of tractable problems.

Peter Jeavons | András Z. Salamon

[1] Stefan Hougardy,et al. Classes of perfect graphs , 2006, Discret. Math..

[2] David A. Cohen,et al. Domain permutation reduction for constraint satisfaction problems , 2008, Artif. Intell..

[3] Francesca Rossi,et al. Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[4] Dale Peterson,et al. Gridline graphs: a review in two dimensions and an extension to higher dimensions , 2003, Discret. Appl. Math..

[5] Paul D. Seymour,et al. Recognizing Berge Graphs , 2005, Comb..

[6] Philippe Jégou. Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[7] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[8] E. Alper Yildirim,et al. On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function , 2006, Comput. Optim. Appl..

[9] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[10] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[11] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.