IncrementalWFOMC3 computes WFOMC on C² in time linear in counting parameters (tighter than prior quadratic) and proves domain-liftability for the richer C²_mod fragment while delivering large empirical speedups.
Weighted first-order model counting in the two-variable fragment with count- ing quantifiers.J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Cofola language and three-phase compiler reduce combinatorial counting problems to practical WFOMC instances while preserving symmetries.
citing papers explorer
-
A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
IncrementalWFOMC3 computes WFOMC on C² in time linear in counting parameters (tighter than prior quadratic) and proves domain-liftability for the richer C²_mod fragment while delivering large empirical speedups.
-
Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
Cofola language and three-phase compiler reduce combinatorial counting problems to practical WFOMC instances while preserving symmetries.