Lifted Inference in 2-Variable Markov Logic Networks with Function and Cardinality Constraints Using Discrete Fourier Transform

06/04/2020
by   Ondrej Kuzelka, et al.
8

In this paper we show that inference in 2-variable Markov logic networks (MLNs) with cardinality and function constraints is domain-liftable. To obtain this result we use existing domain-lifted algorithms for weighted first-order model counting (Van den Broeck et al, KR 2014) together with discrete Fourier transform of certain distributions associated to MLNs.

READ FULL TEXT
research
09/15/2018

The inverse cyclotomic Discrete Fourier Transform algorithm

The proof of the theorem concerning to the inverse cyclotomic Discrete F...
research
02/24/2020

Markov Logic Networks with Complex Weights: Expressivity, Liftability and Fourier Transforms

We study expressivity of Markov logic networks (MLNs). We introduce comp...
research
03/07/2019

Lifted Weight Learning of Markov Logic Networks Revisited

We study lifted weight learning of Markov logic networks. We show that t...
research
02/06/2023

On Exact Sampling in the Two-Variable Fragment of First-Order Logic

In this paper, we study the sampling problem for first-order logic propo...
research
04/02/2019

The Discrete Fourier Transform for Golden Angle Linogram Sampling

Estimation of the Discrete-Space Fourier Transform (DSFT) at points of a...
research
10/27/2018

On the Equivalence of Convolutional and Hadamard Networks using DFT

In this paper we introduce activation functions that move the entire com...
research
10/08/2017

Numerical Algorithms for the Computation of Generalized Prolate Spheroidal Functions

Generalized Prolate Spheroidal Functions (GPSF) are the eigenfunctions o...

Please sign up or login with your details

Forgot password? Click here to reset