Graph invariants as necessary conditions for global constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 92-106

  Beldiceanu, Nicolas ^a   Carlsson, Mats ^b   Rampon, Jean Xavier ^a   Truchet, Charlotte ^a  

^a CNRS   (France)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DIGITAL ARITHMETIC; GRAPH THEORY; MATHEMATICAL MODELS;

GLOBAL CONSTRAINTS; SICSTUS PROLOG IMPLEMENTATION;

CONSTRAINT THEORY;

EID: 33646196683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_10     Document Type: Conference Paper

References (15)

1. M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In Y. Kodratoff, editor, 8th European Conference on Artificial Intelligence, ECAI-88, pages 290-295, Munich, Germany, August 1988. Pitmann Publishing, London.
2. A. Frisch, I. Miguel, and T. Walsh. Extensions to proof planning for generating implied constraints. In Proceedings of Calculemus, 2001.
3. N. Beldiceanu, M. Carlsson, and J.-X. Rampon. Global constraint catalog. Technical Report T2005-06, Swedish Institute of Computer Science, 2005.
4. N. Beldiceanu. Pruning for the minimum constraint family and for the number of distinct values constraint family. In T. Walsh, editor, Principles and Practice of Constraint Programming (CP'2001), volume 2239 of LNCS, pages 211-224. Springer-Verlag, 2001. Preprint available as SICS Tech Report T2000-10.
5. C. Bessière, E, Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Filtering algorithms for the nvalue constraint. In Romand Barták and Michela Milano, editors, International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05), volume 3524 of LNCS, pages 79-93, Prague, Czech Republic, May 2005. Springer Verlag.
6. P. Turán. On an extremal problem in graph theory. Mat. Fiz. Lapok, 48:436-452, 1941. In Hungarian,
7. COSYTEC. CHIP Reference Manual, release 5.1 edition, 1997.
8. J.-C. Régin. A filtering algorithm for constraints of difference in CSP. In 12th National Conference on Artificial Intelligence (AAAI-94), pages 362-367, 1994.
9. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97-123, 1994.
10. N. Beldiceanu, P. Flener, and X. Lorca. The tree constraint. In Romand Barták and Michela Milano, editors, International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05), volume 3524 of LNCS, pages 64-78, Prague, Czech Republic, May 2005. Springer Verlag.
11. Mats Carlsson et al. SICStus Prolog User's Manual. Swedish Institute of Computer Science, 3.11.1 edition, February 2004. http://www.sics.se/sicstus/.
12. Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Constraint processing in cc(FD). Manuscript, 1991.
13. Björn Carlson, Mats Carlsson, and Daniel Diaz. Entailment of finite domain constraints. In P. Van Hentenryck, editor, ICLP'94, Int. Conf. on Logic Programming, MIT Press Series in Logic Programming, S. Margherita Ligure, Italy, 1994. The MIT Press.
14. N. Beldiceanu, M. Carlsson, and T. Petit. Deriving filtering algorithms from constraint checkers. In M. Wallace, editor, Principles and Practice of Constraint Programming (CP'2004), volume 3258 of LNCS, pages 107-122. Springer-Verlag, 2004.
15. N. Beldiceanu, T. Petit, and G. Rochart. Bounds of graph characteristics. In P. van Beek, editor, Principles and Practice of Constraint Programming (CP'2005), LNCS. Springer-Verlag, 2005.