Skip to main content
SpringerLink
Log in

The Order Encoding: From Tractable CSP to Tractable SAT

  • Conference paper
Book cover Theory and Applications of Satisfiability Testing - SAT 2011 (SAT 2011)

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

Abstract

Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs). The general CSP is known to be NP-complete, but many different conditions have been identified which are sufficient to ensure that classes of instances satisfying those conditions are tractable, that is, solvable in polynomial time [1,2,3,4,7].

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. Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Handbook of Constraint Programming, ch. 8, pp. 245–280. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

  2. Cohen, D., et al.: Building tractable disjunctive constraints. Journal of the ACM 47, 826–853 (2000)

    Article  MATH  Google Scholar 

  3. Deville, Y., et al.: Constraint satisfaction over connected row convex constraints. In: Proceedings of IJCAI 1997, pp. 405–411 (1997)

    Google Scholar 

  4. Jeavons, P., Cooper, M.C.: Tractable constraints on ordered domains. Artificial Intelligence Journal, 327–339 (1995)

    Google Scholar 

  5. Petke, J., Jeavons, P.: Local consistency and SAT-solvers. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 398–413. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Prestwich, S.D.: CNF encodings. In: Handbook of Satisfiability, ch. 2, pp. 75–97. IOS Press, Amsterdam (2009)

    Google Scholar 

  7. Schaefer, T.J.: The Complexity of Satisfiability Problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing - STOC 1978, pp. 216–226. ACM, New York (1978)

    Google Scholar 

  8. Tamura, N., et al.: Compiling finite linear CSP into SAT. Constraints Journal 14, 254–272 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, Oxford University, Parks Road, Oxford, UK

    Justyna Petke & Peter Jeavons

Authors
  1. Justyna Petke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Jeavons
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Michigan, 48109, Ann Arbor, MI, USA

    Karem A. Sakallah

  2. LRI / CNRS UMR8623 / INRIA Saclay, Univ Paris-Sud, F-91405, Orsay, France

    Laurent Simon

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petke, J., Jeavons, P. (2011). The Order Encoding: From Tractable CSP to Tractable SAT. In: Sakallah, K.A., Simon, L. (eds) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011. Lecture Notes in Computer Science, vol 6695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21581-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21581-0_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21580-3

  • Online ISBN: 978-3-642-21581-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation