Perfect Constraints Are Tractable

Authors:
András Z. Salamon;Peter G. Jeavons
Affiliations:
Computing Laboratory, University of Oxford, UK and The Oxford-Man Institute for Quantitative Finance,;Computing Laboratory, University of Oxford, UK
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 6
Cited 4

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Gridline graphs: a review in two dimensions and an extension to higher dimensions

Discrete Applied Mathematics
Recognizing Berge Graphs

Combinatorica
On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

Computational Optimization and Applications
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Domain permutation reduction for constraint satisfaction problems

Artificial Intelligence

Presenting Constraints

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hybrid tractability of valued constraint problems

Artificial Intelligence
On guaranteeing polynomially bounded search tree size

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The tractability of CSP classes defined by forbidden patterns

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.