The Complexity of Global Constraints

@inproceedings{Bessiere2004TheCO,
  title={The Complexity of Global Constraints},
  author={Christian Bessiere and Emmanuel Hebrard and Brahim Hnich and Toby Walsh},
  booktitle={AAAI},
  year={2004}
}
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the same tools of computational complexity can be used in the design and analysis of specific global constraints. In particular, we illustrate how computational complexity can be used to determine when a lesser level of local consistency should be enforced, when decomposing constraints will lose pruning, and when combining… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
52 Extracted Citations
27 Extracted References
Similar Papers

Similar Papers

Loading similar papers…