Skip to main content
SpringerLink
Log in

A New Class of Binary CSPs for which Arc-Consistency Is a Decision Procedure

  • Conference paper
Principles and Practice of Constraint Programming – CP 2003 (CP 2003)

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

Abstract

In this report we introduce a new hybrid class for which arc-consistency is a decision procedure.

This new hybrid class includes infinitely many instances whose tractability is not assured by any tractable language or structural restriction, and strongly motivates the search for a unifying principle for the tractable constraint classes decided by arc-consistency.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. Chandru, V., Hooker, J.N.: Extended Horn sets in propositional logic. Journal of the ACM 38, 205–221 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dalmau, V., Pearson, J.: Closure functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 159–173. Springer, Heidelberg (1999)

    Google Scholar 

  4. Green, M.J., Cohen, D.A.: Tractability by approximating constraint languages. Technical Report CSD-TR-03-01, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK (2003)

    Google Scholar 

  5. Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66(1), 57–89 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527–548 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rose, D.J.: Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications 32, 597–609 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  8. Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13(3), 566–579 (1984)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Royal Holloway, University of London, UK

    David A. Cohen

Authors
  1. David A. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, D.A. (2003). A New Class of Binary CSPs for which Arc-Consistency Is a Decision Procedure. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_57

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation