Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint

We study the computational complexity of Boolean constraint satisfaction problems with cardinality constraint. A Galois connection between clones and co-clones has received a lot of attention in the context of complexity considerations for constraint satisfaction problems. This connection fails when considering constraint satisfaction problems that support in addition a cardinality constraint. We prove that a similar Galois connection, involving a weaker closure operator and partial polymorphisms, can be applied to such problems. Thus, we establish dichotomies for the decision as well as for the counting problems in Schaefer's framework.

[1]  Henning Schnoor,et al.  Partial Polymorphisms and Constraint Satisfaction Problems , 2008, Complexity of Constraints.

[2]  Nadia Creignou,et al.  A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[3]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[4]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[5]  Phokion G. Kolaitis,et al.  The complexity of minimal satisfiability problems , 2003, Inf. Comput..

[6]  Lane A. Hemaspaandra.  SIGACT news complexity theory column 42 , 2003, SIGA.

[7]  Neil Immerman,et al.  The Complexity of Satisfiability Problems: Refining Schaefer's Theorem , 2005, MFCS.

[8]  Maxim Sviridenko.  Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint , 2001, Algorithmica.

[9]  Heribert Vollmer,et al.  Bases for Boolean co-clones , 2005, Inf. Process. Lett..

[10]  Heribert Vollmer,et al.  Optimal satisfiability for propositional calculi and constraint satisfaction problems , 2003, Inf. Comput..

[11]  B. A. Romov.  The algebras of partial functions and their invariants , 1981 .

[12]  Edith Hemaspaandra,et al.  Isomorphic Implication , 2005, MFCS.

[13]  Bodo Manthey,et al.  Adding cardinality constraints to integer programs with applications to maximum satisfiability , 2008, Inf. Process. Lett..

[14]  L. A. Kaluzhnin,et al.  Galois theory for post algebras. I , 1969 .

[15]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[16]  Heribert Vollmer,et al.  The Complexity of Boolean Constraint Isomorphism , 2003, STACS.

[17]  Heribert Vollmer,et al.  Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help? , 2008, Complexity of Constraints.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Heribert Vollmer,et al.  Equivalence and Isomorphism for Boolean Constraint Satisfaction , 2002, CSL.

[20]  Dániel Marx,et al.  Parameterized complexity of constraint satisfaction problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[21]  Marek Karpinski,et al.  On the Complexity of Global Constraint Satisfaction , 2005, ISAAC.

[22]  Heribert Vollmer,et al.  Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar] , 2008, Complexity of Constraints.

[23]  Viktória Zankó,et al.  #P-Completeness via Many-One Reductions , 1990, Int. J. Found. Comput. Sci..

[24]  Nadia Creignou,et al.  Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[25]  Phokion G. Kolaitis,et al.  Structure identification of Boolean relations and plain bases for co-clones , 2008, J. Comput. Syst. Sci..

[26]  Nadia Creignou,et al.  A Complete Classification of the Complexity of Propositional Abduction , 2006, SIAM J. Comput..

[27]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[28]  Osamu Watanabe,et al.  Polynomial Time 1-Turing Reductions from #PH to #P , 1992, Theor. Comput. Sci..

[29]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .