Abstract
Using a framework inspired by Schaefer's generalized satisfiability model [Sch78], Cohen, Cooper and Jeavons [CCJ94] studied the computational complexity of constraint satisfaction problems in the special case when the set of constraints is closed under permutation of labels and domain restriction, and precisely identified the tractable (and intractable) cases.
Using the same model we characterize the complexity of three related problems:
-
1.
counting the number of solutions.
-
2.
structure identification (Dechter and Pearl [DP92]).
-
3.
approximating the maximum number of satisfiable constraints.
Supported in part by the NSF grant CCR-9701911
Preview
Unable to display preview. Download preview PDF.
References
M. Cooper, D. Cohen, and P. Jeavons. Characterizing tractable constraints. Artificial Intelligence, 65:347–361, 1994.
D. Clark, J. Frank, I. Gent, E. MacIntyre, N. Tomov, and T. Walsh. Local search and the number of solutions. In E. Render, editor, Principles and Practice of Constraint Programming-CP'96, number 1118 in Lecture Notes in Computer Science, pages 323–337. Springer Verlag, 1996.
N. Creignou and M. Hermann. Complexity of generalized counting problems. Information and Computation, 125(1):1–12, 1996.
R. Dechter and A. Itai. Finding all solutions if you can find one. In Workshop on Tractable Reasoning, AAAI'92, pages 35–39, 1992.
R. Dechter and J. Pearl. Structure identification in relational data. Artificial Intelligence, 58:237–270, 1992.
E. Freuder and R. Wallace. Heuristic methods for over-constrained constraint satisfaction problems. In CP'95 Workshop on Over-Constrained Systems.
E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1-3):21–70, 1992.
S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 819–830. IEEE Computer Society, 1994.
R. Korf. From approximate to optimal solutions: A case study of number partitioning. In Proceedings of the 14th IJCAI, pages 266–272, 1995.
D. Kavvadias and M. Sideri. The inverse satisfiability problem. In Proceeding of the Second Annual International Computing and Combinatorics Conference, pages 250–259, 1996.
S. Khanna, M. Sudan, and D. Williamson. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. Technical Report TR96-062, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eecc/, 1996.
H. Lau. A new approach for weighted constraint satisfaction: theoretical and computational results. In E. Freuder, editor, Principles and Practice of Constraint Programming-CP'96, number 1118 in Lecture Notes in Computer Science, pages 323–337. Springer Verlag, 1996.
A. Mackworth. Consistency in network of relations. Artificial Intelligence, 8:99–118, 1977.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 13th ACM Symposium on Theory of Computing, pages 216–226, 1978.
B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence Journal, 81(1-2):155–181, 1996.
A. Selman. Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control, 52:36–51, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Istrate, G. (1997). Counting, structure identification and maximum consistency for binary constraint satisfaction problems. In: Smolka, G. (eds) Principles and Practice of Constraint Programming-CP97. CP 1997. Lecture Notes in Computer Science, vol 1330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017435
Download citation
DOI: https://doi.org/10.1007/BFb0017435
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63753-0
Online ISBN: 978-3-540-69642-1
eBook Packages: Springer Book Archive