Skip to main content
SpringerLink
Log in

Tree Dualities for Constraint Satisfaction

  • Conference paper
Computer Science Logic (CSL 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6247))

Included in the following conference series:

  • 861 Accesses

Abstract

For a fixed relational vocabulary τ and a fixed finite τ-structure B, the constraint satisfaction problem for B, denoted CSPB, is to decide whether there is a homomorphism from a given finite τ-structure A to B (A → B, in symbols). The study of such problems has recently been a very active research area.

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 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. Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: FOCS 2009, pp. 595–603 (2009)

    Google Scholar 

  2. Bulatov, A., Krokhin, A., Larose, B.: Dualities for constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 93–124. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Carvalho, C., Dalmau, V., Krokhin, A.: Caterpillar duality for constraint satisfaction problems. In: LICS 2008, pp. 307–316 (2008)

    Google Scholar 

  4. Carvalho, C., Dalmau, V., Krokhin, A.: CSP duality and trees of bounded pathwidth. Theoretical Computer Science (2010) (to appear)

    Google Scholar 

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

    Google Scholar 

  6. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57–104 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Computing Sciences, Durham University, Durham, DH1 3LE, UK

    Andrei Krokhin

Authors
  1. Andrei Krokhin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Laboratory, University of Cambridge, J.J. Thomson Avenue, CB3 0FD, Cambridge, UK

    Anuj Dawar

  2. Formal Methods in Systems Engineering, Vienna University of Technology, Favoritenstr. 9-11, 1040, Vienna, Austria

    Helmut Veith

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krokhin, A. (2010). Tree Dualities for Constraint Satisfaction. In: Dawar, A., Veith, H. (eds) Computer Science Logic. CSL 2010. Lecture Notes in Computer Science, vol 6247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15205-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15205-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15204-7

  • Online ISBN: 978-3-642-15205-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation