Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting

We consider the weighted satisfiability problem for Boolean circuits and propositional formulae, where the weight of an assignment is the number of variables set to true. We study the parameterized complexity of these problems and initiate a systematic study of the complexity of its fragments. Only the monotone fragment has been considered so far and proven to be of same complexity as the unrestricted problems. Here, we consider all fragments obtained by semantically restricting circuits or formulae to contain only gates (connectives) from a fixed set B of Boolean functions. We obtain a dichotomy result by showing that for each such B, the weighted satisfiability problems are either W[P]-complete (for circuits) or W[SAT]-complete (for formulae) or efficiently solvable. We also consider the related enumeration and counting problems.

[1]  Stefan Kratsch,et al.  Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems , 2010, MFCS.

[2]  Michael Thomas.  On the applicability of Post's lattice , 2012, Inf. Process. Lett..

[3]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[4]  Henning Schnoor,et al.  Nonuniform Boolean constraint satisfaction problems with cardinality constraint , 2010, TOCL.

[5]  Harry R. Lewis,et al.  Satisfiability problems for propositional calculi , 1979, Mathematical systems theory.

[6]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..

[9]  Heribert Vollmer,et al.  Introduction to Circuit Complexity , 1999, Texts in Theoretical Computer Science An EATCS Series.

[10]  Heribert Vollmer,et al.  The Complexity of Generalized Satisfiability for Linear Temporal Logic , 2006, Electron. Colloquium Comput. Complex..

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

[12]  Arne Meier,et al.  Paradigms for Parameterized Enumeration , 2013, MFCS.

[13]  Heribert Vollmer,et al.  Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems , 2010, Log. Methods Comput. Sci..

[14]  Henning Schnoor.  The Complexity of Model Checking for Boolean Formulas , 2010, Int. J. Found. Comput. Sci..

[15]  Catherine McCartin.  Parameterized counting problems , 2006, Ann. Pure Appl. Log..

[16]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[17]  Arne Meier,et al.  The Complexity of Reasoning for Fragments of Autoepistemic Logic , 2010, TOCL.

[18]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

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

[20]  Klaus W. Wagner,et al.  The Complexity of Problems Defined by Boolean Circuits , 2005 .