Weighted First-Order Model Counting in the Two-Variable Fragment With
Counting Quantifiers
Journal of Artificial Intelligence Research (JAIR), 2020
Abstract
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.
View on arXivComments on this paper
