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].
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Cohen, D., Jeavons, P.: The complexity of constraint languages. In: Handbook of Constraint Programming, ch. 8, pp. 245–280. Elsevier, Amsterdam (2006)
Cohen, D., et al.: Building tractable disjunctive constraints. Journal of the ACM 47, 826–853 (2000)
Deville, Y., et al.: Constraint satisfaction over connected row convex constraints. In: Proceedings of IJCAI 1997, pp. 405–411 (1997)
Jeavons, P., Cooper, M.C.: Tractable constraints on ordered domains. Artificial Intelligence Journal, 327–339 (1995)
Petke, J., Jeavons, P.: Local consistency and SAT-solvers. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 398–413. Springer, Heidelberg (2010)
Prestwich, S.D.: CNF encodings. In: Handbook of Satisfiability, ch. 2, pp. 75–97. IOS Press, Amsterdam (2009)
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)
Tamura, N., et al.: Compiling finite linear CSP into SAT. Constraints Journal 14, 254–272 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)