Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
Artificial Intelligence
2020-08-17 v3 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.2007.05619,
title = {Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers},
author = {Ondrej Kuzelka},
journal= {arXiv preprint arXiv:2007.05619},
year = {2020}
}
Comments
This version: Fixed typos in the statement of Proposition 4 (missing dependency on bit-complexity of w and \overline{w} in the statement of the proposition) and in Eq. 19 (missing negation)