Result: Graph invariants as necessary conditions for global constraints

Title:
Graph invariants as necessary conditions for global constraints
Source:
Principles and practice of constraint programming - CP 2005 (11th international conference, CP 2005, Sitges, Spain, October 1-5, 2005, proceedings)Lecture notes in computer science. :92-106
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 15 ref 1
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
LINA FRE CNRS 2729, École des Mines de Nantes, 44307 Nantes, France
SICS, P.O. Box 1263, 164 29 Kista, Sweden
LINA FRE CNRS 2729, 2 rue de la Houssinière, BP-92208, 44322 Nantes, France
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17324890
Database:
PASCAL Archive

Further Information

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.