Exploiting Database Management Systems and Treewidth for Counting

Bounded treewidth is one of the most cited combinatorial invariants, which was applied in the literature for solving several counting problems efficiently. A canonical counting problem is #SAT, which asks to count the satisfying assignments of a Boolean formula... (read more)

Results in Papers With Code
(↓ scroll down to see all results)