Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2000: Principles and Practice of Constraint Programming – CP 2000 pp 543–548Cite as

An Original Constraint Based Approach for Solving over Constrained Problems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1894))

Abstract

In this paper we present a new framework for over constrained problems. We suggest to define an over-constrained network as a global constraint. We introduce two new lower bounds of the number of violations, without making any assumption on the arity of constraints.

The work of ILOG authors was partially supported by the IST Programme of the Commission of the European Union through the ECSPLAIN project (IST-1999-11969).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier. Semiring-based csps and valued csps: Frameworks, properties, and comparison. Constraints, 4:199–240, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.

    Article  MathSciNet  Google Scholar 

  3. J. L. de Siqueira N. and J.-F. Puget. Explanation-based generalization of failures. Proceedings ECAI, pages 339–344, 1988.

    Google Scholar 

  4. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107:149–163, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Larrossa and P. Meseguer. Partition-based lower bound for max-csp. Proceedings CP, pages 303–315, 1999.

    Google Scholar 

  6. H. Simonis. Problem classification scheme for finite domain constraint solving. CP Workshop on C. P. Applications: An Inventory and Taxonomy, pages 1–26, 1996.

    Google Scholar 

  7. R. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. Proceedings’ ECA I, pages 69–77, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG, 1681, route des Dolines, 06560, Valbonne, France

    J. -C. Régin & T. Petit

  2. LIRMM (UMR 5506 CNRS), 161, rue Ada, 34392, Montpellier Cedex 5, France

    T. Petit & C. Bessière

  3. ILOG S.A., 9, rue de Verdun, BP 85, 94253, Gentilly Cedex, France

    J. -F. Puget

Authors
  1. J. -C. Régin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Bessière
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. -F. Puget
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Régin, J.C., Petit, T., Bessière, C., Puget, J.F. (2000). An Original Constraint Based Approach for Solving over Constrained Problems. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41053-9

  • Online ISBN: 978-3-540-45349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation