Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat

Download PDF
Open Webpage

Jan Tóth, Ondrej Kuzelka

Published: 2024, Last Modified: 07 Jan 2026KR 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We study the time complexity of weighted first-order model counting (WFOMC) over the logical language with two variables and counting quantifiers. The problem is known to be solvable in time polyno...