[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Reformulation of Non-binary Constraints

  • Conference paper
  • First Online:
Abstraction, Reformulation, and Approximation (SARA 2002)

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

  • 854 Accesses

Abstract

Constraint satisfaction problems (CSPs) frequently emerge in practical situations. Unfortunately these problems are likely to be computationally intractable. In practice, it is necessary to implement strategies that reduce the amount of computational effort expended in finding solutions to CSPs.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Gent, I.P., Stergiou, K., Walsh, T.: Decomposable constraints. In: New Trends in Constraints. (1999) 134–149

    Google Scholar 

  2. Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: AAAI/IAAI. (1998) 310–318

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Constraint Systems Laboratory Department of Computer Science and Engineering, University of Nebraska-Lincoln, 115 Ferguson Hall, Lincoln, NE, 68588-0115

    Robert Glaubius

Authors
  1. Robert Glaubius
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 801 Atlantic Dr NW, Atlanta, GA, 30332-0280, USA

    Sven Koenig

  2. Department of Computing Science, Universtity of Alberta, 2-21 Athabasca Hall, Edmonton, Alberta, T6G 2E8, Canada

    Robert C. Holte

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glaubius, R. (2002). Reformulation of Non-binary Constraints. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-45622-8_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43941-7

  • Online ISBN: 978-3-540-45622-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics