Skip to main content

Abstraction and Reformulation in the Generation of Constraint Models

(Extended Abstract)

  • Conference paper
Abstraction, Reformulation, and Approximation (SARA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4612))

  • 638 Accesses

Abstract

Many and diverse combinatorial problems have been solved with great success using constraint programming. However, to employ constraint programming technology to solve a problem, the problem first must be characterised, or modelled, by a set of constraints that its solutions must satisfy. Generating a correct model can be difficult; generating one that is easier to solve than its alternatives is even more difficult, often requiring considerable expertise. This so-called “modelling bottleneck” has inhibited the wider use of constraint programming technology.

The work report here was done in collaboration with Matthew Grum, Chris Jefferson, Bernadette Martínez Hernández and Ian Miguel.

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

References

  1. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  2. Frisch, A.M., Grum, M., Jefferson, C., Hernández, B.M., Miguel, I.: The design of Essence: A language for specifying combinatorial problems. In: Proc. of the Twentieth Int. Joint Conf. on Artificial Intelligence (2007)

    Google Scholar 

  3. Frisch, A.M., Jefferson, C., Hernández, B.M., Miguel, I.: The rules of constraint modelling. In: Proc. of the Nineteenth Int. Joint Conf. on Artificial Intelligence, pp. 109–116 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ian Miguel Wheeler Ruml

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frisch, A.M. (2007). Abstraction and Reformulation in the Generation of Constraint Models. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73580-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73579-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics