Non-uniform Boolean constraint satisfaction problems with cardinality constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5213 LNCS, Issue , 2008, Pages 109-123

  Creignou, Nadia ^a   Schnoor, Henning ^b   Schnoor, Ilka ^c  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF KIEL   (Germany)

^c UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTERS; CRYSTAL LATTICES; TECHNICAL PRESENTATIONS;

BOOLEAN CONSTRAINTS; CARDINALITY CONSTRAINTS; CLOSURE OPERATORS; CONSTRAINT SATISFACTION PROBLEMS; GALOIS CONNECTIONS; NON UNIFORMS;

STEELMAKING;

EID: 57849116949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-410     Document Type: Conference Paper

References (26)

1. Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: Renfining Schaefer's theorem, In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005, LNCS, vol. 3618, pp. 71-82, Springer, Heidelberg (2005)
2. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory. ACMSIGACT Newsletter 34(4), 38-52 (2003)
3. Bauland, M., Hemaspaandra, E.: Isomorphic implication. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005, LNCS, vol. 3618, pp. 119-130. Springer, Heidelberg (2005); Theory of Computing Systems (to appear)
4. Bläser, M., Heynen, T., Manthey, B.: Adding cardinality constraints to integer programs with applications to maximum satisfiability, Information Processing Letters 105, 194-198 (2008)
5. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence and isomorphism for Boolean constraint satisfaction. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002, LNCS, vol. 2471, pp. 412-426, Springer, Heidelberg (2002)
6. Böhler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: The complexity of Boolean constraint isomorphism, In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 164-175, Springer, Heidelberg (2004)
7. Bazgan, C., Karpinski, M.: On the complexity of global constraint satisfaction. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 624-633, Springer, Heidelberg (2005)
8. Bodnarchuk, V.G., Kalužnin, L.A., Kotov, V.N., Romov, B.A.: Galois theory for Post algebras I, II. Cybernetics 5, 243-252, 531-539 (1969)
9. Böhler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean coclones. Information Processing Letters 96, 59-66 (2005)
10. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation 125, 1-12 (1996)
11. Creignou, N., Kolaitis, P., Zanuttini, B.: Structure identification for Boolean relations and plain bases for co-clones. Journal of Computer and System Sciences (in press, 2008)
12. Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences 51, 511-522 (1995)
13. Creignou, N., Vollmer, H.: Boolean constraint satisfaction problems: when does Post's lattice help? In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. Springer, Heidelberg (to appear, 2008)
14. Creignou, N., Zanuttini, B.: A complete classification of the complexity of prepositional abduction. SIAM Journal on Computing 36(1), 207-229 (2006)
15. Geiger, D.: Closed systems of functions and predicates. Pac. J. Math. 27(2), 228-250 (1968)
16. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
17. Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185-204 (1998)
18. Kirousis, L.M., Kolaitis, P.G.: The complexity of minimal satisfiability problems. Information and Computation 187(1), 20-39 (2003)
19. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM Journal on Computing 30, 1863-1920 (2001)
20. Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity 14(2), 153-183 (2005)
21. Post, E.L.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies 5, 1-122 (1941)
22. Romov, B.A.: The algebras of partial functions and their invariants. Cybernetics and Systems Analysis 17(2), 157-167 (1981)
23. Reith, S., Vollmer, H.: Optimal satisfiability for prepositional calculi and constraint satisfaction problems. Information and Computation 186(1), 1-19 (2003)
24. Schaefer, T. J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing, pp. 216-226. ACM Press, New York (1978)
25. Schnoor, H., Schnoor, I.: Partial polymorphisms and constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. Springer, Heidelberg (to appear, 2008)
26. Sviridenko, M.I.: Best possible approximation algorithm for MAX-SAT with cardinality constraint. Algorithmica 30(3), 398-405 (2001)