Weighted first-order model counting in the two-variable fragment with counting quantifiers

26Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Kuželka, O. (2021). Weighted first-order model counting in the two-variable fragment with counting quantifiers. Journal of Artificial Intelligence Research, 70, 1281–1307. https://doi.org/10.1613/JAIR.1.12320

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free