Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type

  • Authors:
  • Nicolas Beldiceanu

  • Affiliations:
  • -

  • Venue:
  • CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a classification scheme for global constraints. This classification is based on a small number of basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in terms of graph properties that have to hold, where the graph is a structured network of same elementary constraints