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

07/10/2020
by   Ondrej Kuzelka, et al.
1

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.

READ FULL TEXT

page 7

page 11

page 23

research
04/26/2018

Weighted model counting beyond two-variable logic

It was recently shown by van den Broeck at al. that the symmetric weight...
research
11/02/2022

Lifted Inference with Linear Order Axiom

We consider the task of weighted first-order model counting (WFOMC) used...
research
12/19/2013

Skolemization for Weighted First-Order Model Counting

First-order model counting emerged recently as a novel reasoning task, a...
research
04/08/2022

On Presburger arithmetic extended with non-unary counting quantifiers

We consider a first-order logic for the integers with addition. This log...
research
04/04/2019

Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting

Weighted model counting has emerged as a prevalent approach for probabil...
research
06/07/2023

Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures

First-order model counting (FOMC) is a computational problem that asks t...
research
08/20/2019

Two-variable logic revisited

In this paper we present another proof for the well-known small model pr...

Please sign up or login with your details

Forgot password? Click here to reset