Exploiting Treewidth for Projected Model Counting and its Limits

by   Johannes K. Fichte, et al.

In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC asks to count solutions of a Boolean formula with respect to a given set of projected variables, where multiple solutions that are identical when restricted to the projected variables count as only one solution. Our algorithm exploits small treewidth of the primal graph of the input instance. It runs in time O(2^2^k+4 n^2) where k is the treewidth and n is the input size of the instance. In other words, we obtain that the problem PMC is fixed-parameter tractable when parameterized by treewidth. Further, we take the exponential time hypothesis (ETH) into consideration and establish lower bounds of bounded treewidth algorithms for PMC, yielding asymptotically tight runtime bounds of our algorithm.



There are no comments yet.


page 1

page 2

page 3

page 4


Treewidth and Counting Projected Answer Sets

In this paper, we introduce novel algorithms to solve projected answer s...

TE-ETH: Lower Bounds for QBFs of Bounded Treewidth

The problem of deciding the validity (QSAT) of quantified Boolean formul...

Counting Complexity for Reasoning in Abstract Argumentation

In this paper, we consider counting and projected model counting of exte...

Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

The Cut Count technique and the rank-based approach have lead to sin...

On exploiting degeneracy to count subgraphs

Motivated by practical applications, we study the complexity of counting...

Regular resolution for CNF of bounded incidence treewidth with few long clauses

We demonstrate that Regular Resolution is FPT for two restricted familie...

Exploiting Database Management Systems and Treewidth for Counting

Bounded treewidth is one of the most cited combinatorial invariants, whi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.