Closed-form solutions in learning probabilistic logic programs by exact score maximization

DOI10.1007/978-3-319-67582-4_9zbMATH Open1498.68254OpenAlexW2755242768WikidataQ62046511 ScholiaQ62046511MaRDI QIDQ5045306FDOQ5045306

Authors: Francisco Henrique Otte Vieira de Faria, Fabio Gagliardi Cozman, D. D. Maua 

Publication date: 4 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67582-4_9

Recommendations

• Speeding up parameter and rule learning for acyclic probabilistic logic programs
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Inductive Logic Programming
• Algorithmic Learning Theory
• scientific article; zbMATH DE number 1950779

zbMATH Keywords

Bayesian networksprobabilistic logic programmingscore-based structure learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Logic programming (68N17)

Cited In (3)

• Speeding up parameter and rule learning for acyclic probabilistic logic programs
• Generalized ordering-search for learning directed probabilistic logical models
• Structure learning of probabilistic logic programs by searching the clause space

This page was built for publication: Closed-form solutions in learning probabilistic logic programs by exact score maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045306)