Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint

Authors:
Nadia Creignou;Henning Schnoor;Ilka Schnoor
Affiliations:
LIF (CNRS UMR 6166), Université d'Aix-Marseille, Marseille, France F-13288;Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, Germany D-24098;Institut für Theoretische Informatik, Universität Lübeck, Lübeck, Germany D-23538
Venue:
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Year:
2008

Citing 17
Cited 3

A dichotomy theorem for maximum generalized satisfiability problems

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems

Information and Computation
On the algebraic structure of combinatorial problems

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
Equivalence and Isomorphism for Boolean Constraint Satisfaction

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Optimal satisfiability for propositional calculi and constraint satisfaction problems

Information and Computation
The complexity of minimal satisfiability problems

Information and Computation
A Complete Classification of the Complexity of Propositional Abduction

SIAM Journal on Computing
Adding cardinality constraints to integer programs with applications to maximum satisfiability

Information Processing Letters
Parameterized complexity of constraint satisfaction problems

Computational Complexity
Structure identification of Boolean relations and plain bases for co-clones

Journal of Computer and System Sciences
Bases for Boolean co-clones

Information Processing Letters
On the complexity of global constraint satisfaction

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The complexity of satisfiability problems: refining Schaefer's theorem

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Isomorphic implication

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Constraint satisfaction problems and global cardinality constraints

Communications of the ACM
Parameterized complexity and kernelizability of max ones and exact ones problems

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Constraint satisfaction parameterized by solution size

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.