Lifted Weight Learning of Markov Logic Networks Revisited

03/07/2019
by   Ondrej Kuzelka, et al.
0

We study lifted weight learning of Markov logic networks. We show that there is an algorithm for maximum-likelihood learning of 2-variable Markov logic networks which runs in time polynomial in the domain size. Our results are based on existing lifted-inference algorithms and recent algorithmic results on computing maximum entropy distributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2020

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

In this paper we show that inference in 2-variable Markov logic networks...
research
07/03/2018

Domain Aware Markov Logic Networks

Combining logic and probability has been a long standing goal of AI. Mar...
research
07/03/2018

Quantified Markov Logic Networks

Markov Logic Networks (MLNs) are well-suited for expressing statistics s...
research
07/03/2018

Markov Logic Networks with Statistical Quantifiers

Markov Logic Networks (MLNs) are well-suited for expressing statistics s...
research
05/31/2019

Neural Markov Logic Networks

We introduce Neural Markov Logic Networks (NMLNs), a statistical relatio...
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
06/28/2016

On the Semantic Relationship between Probabilistic Soft Logic and Markov Logic

Markov Logic Networks (MLN) and Probabilistic Soft Logic (PSL) are widel...

Please sign up or login with your details

Forgot password? Click here to reset