Skip to main content

Abstract

The logical connectives between constraints, sometimes called meta-constraints, although extremely useful for modelling problems, have either poor filtering algorithms or are not very efficient. We propose in this paper new filtering algorithms that achieve arc-consistency over those logical connectives. The principle is to export supports from a constraint.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ILOG: ILOG JConfigurator 2.0 User’s Manual. ILOG S.A. (2003)

    Google Scholar 

  2. Lhomme, O.: An efficient filtering algorithm for disjunction of constraints. In: Proc. of the the Conference on Principles and Practice of Constraint Programming, pp. 904–908 (2003)

    Google Scholar 

  3. Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(FD). In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, Springer, Heidelberg (1995)

    Google Scholar 

  4. Würtz, J., Müller, T.: Constructive disjunction revisited. In: Görz, G., Hölldobler, S. (eds.) 20th German Annual Conference on Artificial Intelligence, Dresden, Germany. LNCS, vol. 1137, pp. 377–386. Springer, Heidelberg (1996)

    Google Scholar 

  5. Bessière, C.: Arc-consistency and arc-consistency again. Artificial Intelligence 65, 179–190 (1994)

    Article  Google Scholar 

  6. Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)

    Article  Google Scholar 

  7. Bessière, C., Régin, J.C.: Arc consistency for general constraints networks: preliminary results. In: IJCAI 1997, Nagoya, pp. 398–404 (1997)

    Google Scholar 

  8. Bessière, C., Régin, J.C.: Enforcing arc consistency on global constraints by solving subproblems on the fly. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 103–117. Springer, Heidelberg (1999)

    Google Scholar 

  9. Van Hentenryck, P., Deville, Y., Teng, C.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lhomme, O. (2004). Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24664-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21836-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics