mlsanityData to 7 Oct 2026

Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers

arXiv 2007.05619 ↗First posted 10 Jul 2020cs.AI cs.LOcited by 16

Not on the map. Why?

Abstract (arXiv)

It is known due to the work of Van den Broeck et al [KR, 2014] that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain elements. In this paper we extend this result to the two-variable fragment with counting quantifiers.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 5; 2024: 1; 2025: 5; 2026: 3.

16 papers.

Sort: