Abstract
An instance of a constraint satisfaction problem is l-consistent if any l constraints of it can be simultaneously satisfied. For a fixed constraint type P, ρ l (P) denotes the largest ratio of constraints which can be satisfied in any l-consistent instance. In this paper, we study locally consistent constraint satisfaction problems for constraints which are Boolean predicates. We determine the values of ρ l (P) for all l and all Boolean predicates which have a certain natural property which we call 1-extendibility as well as for all Boolean predicates of arity at most three. All our results hold for both the unweighted and weighted versions of the problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cook, S.: The Complexity of Theorem-proving Procedures. In: Proc. of the 3rd ACM Symposium on Theory of Computing, pp. 29–33. ACM, New York (1971)
Cook, S., Mitchell, D.: Finding Hard Instances of the Satisfiability Problem: A Survey. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, AMS, Providence (1997)
Eppstein, D.: Improved Algorithms for 3-coloring, 3-edge-coloring and Constraint Satisfaction. In: Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 329–337. SIAM, Philadelphia (2001)
Feder, T., Motwani, R.: Worst-case Time Bounds for Coloring and Satisfiability Problems. J. Algorithms 45(2), 192–201 (2002)
Hagerup, T., Rüb, C.: A guided tour Chernoff bounds. Inform. Process. Letters 33, 305–308 (1989)
Huang, M.A., Lieberherr, K.: Implications of Forbidden Structures for Extremal Algorithmic Problems. Theoretical Computer Science 40, 195–210 (1985)
Jukna, S.: Extremal Combinatorics with Applications in Computer Science. Springer, Heidelberg (2001)
Král, D.: Locally Satisfiable Formulas. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 323–332. SIAM, Philadelphia (2004)
Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction. J. of the ACM 28(2), 411–422 (1981)
Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction II. Technical Report 293, Dept. of EECS, Princeton University (1982)
Trevisan, L.: On Local versus Global Satisfiability. SIAM J. Disc. Math. (to appear); A preliminary version is available as ECCC report TR97-12
Usiskin, Z.: Max-min Probabilities in the Voting Paradox. Ann. Math. Stat. 35, 857–862 (1963)
Woeginger, G.J.: Exact Algorithms for NP-hard Problems: A Survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)
Yannakakis, M.: On the Approximation of Maximum Satisfiability. J. Algorithms 17, 475–502 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dvořák, Z., Král’, D., Pangrác, O. (2004). Locally Consistent Constraint Satisfaction Problems. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive