Speeding up parameter and rule learning for acyclic probabilistic logic programs

DOI10.1016/j.ijar.2018.12.012zbMath1456.68168OpenAlexW2905624820WikidataQ62046504 ScholiaQ62046504MaRDI QIDQ1999576

Francisco H. O. Vieira de Faria, Fabio Gagliardi Cozman, Arthur Colombini Gusmão, Denis Deratani Mauá, Glauber De Bona

Publication date: 27 June 2019

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2018.12.012

zbMATH Keywords

expectation-maximization algorithmprobabilistic logic programmingrule learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Uses Software

• UCI-ml
• ProbLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of first-order logics of probability
• Probabilistic logic programming
• Probabilistic Horn abduction and Bayesian networks
• Some first-order probability logics
• Probabilistic inductive logic programming. Theory and applications
• Markov logic networks
• Learning Optimal Bayesian Networks: A Shortest Path Perspective
• Probabilistic Rule Learning
• Logical and Relational Learning
• Structure learning of probabilistic logic programs by searching the clause space
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Closed-Form Solutions in Learning Probabilistic Logic Programs by Exact Score Maximization
• Bayesian Networks
• Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networks
• The Independent Choice Logic and Beyond
• Inductive Logic Programming

This page was built for publication: Speeding up parameter and rule learning for acyclic probabilistic logic programs