Lifted Weight Learning of Markov Logic Networks Revisited

2019/03/07 by Ondřej Kuželka, Kuzelka, Ondrej, Vyacheslav Kungurtsev +1
Computer Science · #Artificial Intelligence (cs.AI) #Bayesian Modeling and Causal Inference #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.1903.03099

openalex publication_date 2019/03/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• Lifted Inference in 2-Variable Markov Logic Networks with Function and Cardinality Constraints Using Discrete Fourier Transform
• Domain Aware Markov Logic Networks
• Maximum Likelihood Bounded Tree-Width Markov Networks
• Complex Markov Logic Networks: Expressivity and Liftability
• Domain size asymptotics for Markov logic networks