Researchers have developed a new algorithm, IncrementalWFOMC3, designed for weighted first-order model counting (WFOMC) within the two-variable logic fragment with counting quantifiers ($\mathbf{C}^2$) and its modulo counting extension ($\mathbf{C}^2_{\text{mod}}$). This algorithm operates directly on a Scott normal form, avoiding the overhead of quantifier elimination reductions used in prior methods. The new approach achieves a tighter data-complexity bound for WFOMC in $\mathbf{C}^2$ and proves domain-liftability for $\mathbf{C}^2_{\text{mod}}$, demonstrating significant runtime improvements over existing algorithms. AI
IMPACT Introduces a more efficient algorithm for lifted probabilistic inference, potentially improving performance in AI systems that rely on logical reasoning and model counting.
RANK_REASON This is a research paper detailing a new algorithm for a specific logic fragment. [lever_c_demoted from research: ic=1 ai=1.0]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
