Graph Invariants as Necessary Conditions for Global Constraints | Zendy

Nicolas Beldiceanu | Zendy; Mats Carlsson | Zendy; Jean-Xavier Rampon | Zendy; Charlotte Truchet | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Graph Invariants as Necessary Conditions for Global Constraints

Author(s) -

Nicolas Beldiceanu,

Mats Carlsson,

Jean-Xavier Rampon,

Charlotte Truchet

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/11564751_10

Subject(s) - computer science , graph , theoretical computer science , graph property , prolog , constraint (computer aided design) , graph rewriting , representation (politics) , voltage graph , mathematics , line graph , geometry , politics , political science , law

This report presents a database of about graph invariants for de- riving systematically necessary conditions from the graph properties based rep- resentation 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 indexi- cals is available.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research