ML Anthology

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

Ondrej Kuzelka
JAIR 2021 pp. 1281-1307
doi:10.1613/JAIR.1.12320 /jair/2021/kuzelka2021jair-weighted/

Abstract

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.

PDF JAIR Semantic Scholar

Cite

Text

Kuzelka. "Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers." Journal of Artificial Intelligence Research, 2021. doi:10.1613/JAIR.1.12320

Markdown

[Kuzelka. "Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers." Journal of Artificial Intelligence Research, 2021.](https://mlanthology.org/jair/2021/kuzelka2021jair-weighted/) doi:10.1613/JAIR.1.12320

BibTeX

@article{kuzelka2021jair-weighted,
  title     = {{Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers}},
  author    = {Kuzelka, Ondrej},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2021},
  pages     = {1281-1307},
  doi       = {10.1613/JAIR.1.12320},
  volume    = {70},
  url       = {https://mlanthology.org/jair/2021/kuzelka2021jair-weighted/}
}