Graph Invariants as Necessary Conditions for Global Constraints

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is based on invariants on the graph characteristics used in the description of a global constraint. A SICStus Prolog implementation based on arithmetic and logical constraints as well as on indexicals is available.