2000 character limit reached
Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
Published 10 Jul 2020 in cs.AI and cs.LO | (2007.05619v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.