Abstract
Constraint Satisfaction Problems (csp) constitute a convenient way to capture many combinatorial problems. The general csp is known to be NP-complete, but its complexity depends on a parameter, usually a set of relations, upon which they are constructed. Following the parameter, there exist tractable and intractable instances of csps. In this paper we show a dichotomy theorem for every finite domain of csp including also disjunctions. This dichotomy condition is based on a simple condition, allowing us to classify monotone csps as tractable or NP-complete. We also prove that the meta-problem, verifying the tractability condition for monotone constraint satisfaction problems, is fixed-parameter tractable. Moreover, we present a polynomial-time algorithm to answer this question for monotone csps over ternary domains.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the Association for Computing Machinery 53(1), 66–120 (2006)
Cohen, D., Jeavons, P., Jonsson, P., Koubarakis, M.: Building tractable disjunctive constraints. Journal of the Association for Computing Machinery 47(5), 826–853 (2000)
Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)
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(1), 57–104 (1998)
Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200(1-2), 185–204 (1998)
Krasner, M.: Une généralisation de la notion de corps. Journal de Mathématiques pures et appliquées 17, 367–385 (1938)
Pöschel, R.: Galois connections for operations and relations. In: Denecke, K., et al. (eds.) Galois Connections and Applications, pp. 231–258. Kluwer, Dordrecht (2004)
Salomaa, A.: Composition sequences for functions over a finite domain. Theoretical Computer Science 292(1), 263–281 (2003)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing (STOC 1978), San Diego, California, USA, pp. 216–226 (1978)
Yanov, Y.I., Muchnik, A.A.: On the existence of k-valued closed classes that have no bases. Doklady Akademii Nauk SSSR 127, 44–46 (1959) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hermann, M., Richoux, F. (2009). On the Computational Complexity of Monotone Constraint Satisfaction Problems. In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-00202-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00201-4
Online ISBN: 978-3-642-00202-1
eBook Packages: Computer ScienceComputer Science (R0)