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

Kuzelka, Ondrej

Journal of Artificial Intelligence Research 

It is known due to the work of Van den Broeck, Meert and Darwiche 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.