Skip to main content

Graph Invariants as Necessary Conditions for Global Constraints

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 3709)

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.

Keywords

  • Global Constraint
  • Graph Characteristic
  • Graph Property
  • Graph Class
  • Graph Constraint

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11564751_10
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-32050-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dincbas, M., Simonis, H., Van Hentenryck, P.: Solving the car-sequencing problem in constraint logic programming. In: Kodratoff, Y. (ed.) 8th European Conference on Artificial Intelligence, ECAI 1988, Munich, Germany, August 1988, pp. 290–295. Pitmann Publishing, London (1988)

    Google Scholar 

  2. Frisch, A., Miguel, I., Walsh, T.: Extensions to proof planning for generating implied constraints. In: Proceedings of Calculemus (2001)

    Google Scholar 

  3. Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical Report T2005-06, Swedish Institute of Computer Science (2005)

    Google Scholar 

  4. Beldiceanu, N.: Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 211–224. Springer, Heidelberg (2001); Preprint available as SICS Tech Report T2000-10

    CrossRef  Google Scholar 

  5. Bessière, C., Hebrard, E., Hnich, B., Kızıltan, Z., Walsh, T.: Filtering algorithms for the nvalue constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 79–93. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  6. Turán, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (1941) (In Hungarian)

    MATH  MathSciNet  Google Scholar 

  7. COSYTEC. CHIP Reference Manual, release 5.1 edition (1997)

    Google Scholar 

  8. Régin, J.-C.: A filtering algorithm for constraints of difference in CSP. In: 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 362–367 (1994)

    Google Scholar 

  9. Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathl. Comput. Modelling 20(12), 97–123 (1994)

    MATH  CrossRef  Google Scholar 

  10. Beldiceanu, N., Flener, P., Lorca, X.: The tree constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 64–78. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  11. Carlsson, M., et al.: SICStus Prolog User’s Manual. Swedish Institute of Computer Science, 3.11.1 edition (February 2004), http://www.sics.se/sicstus/

  12. Van Hentenryck, P., Saraswat, V., Deville, Y.: Constraint processing in cc(FD) (Manuscript 1991)

    Google Scholar 

  13. Carlson, B., Carlsson, M., Diaz, D.: Entailment of finite domain constraints. In: Van Hentenryck, P. (ed.) ICLP 1994, Int. Conf. on Logic Programming, S. Margherita Ligure, Italy. MIT Press Series in Logic Programming. The MIT Press, Cambridge (1994)

    Google Scholar 

  14. Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107–122. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  15. Beldiceanu, N., Petit, T., Rochart, G.: Bounds of graph characteristics. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 742–746. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beldiceanu, N., Carlsson, M., Rampon, JX., Truchet, C. (2005). Graph Invariants as Necessary Conditions for Global Constraints. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_10

Download citation

  • DOI: https://doi.org/10.1007/11564751_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)