Graph Invariants as Necessary Conditions for Global Constraints

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.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet
• Keywords: CP 2005, Global Constraint, Graph Invariants, Graph Properties, Programming Languages