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.
Markov logic networks.Mach
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.