Optimizing Probabilities in Probabilistic Logic Programs

DOI10.1017/S1471068421000260OpenAlexW3202825928MaRDI QIDQ5019596

Fabrizio Riguzzi, Damiano Azzolini

Publication date: 10 January 2022

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.03095

zbMATH Keywords

optimizationconstraintsprobabilistic logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Explanations as programs in probabilistic logic programming

Uses Software

• SymPy
• TOMP
• CUDD
• ProbLog
• NLopt
• kProbLog
• SWI-Prolog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5--9, 2011. Proceedings, Part I
• Allocation and scheduling of conditional task graphs
• kProbLog: an algebraic Prolog for machine learning
• A semantics for hybrid probabilistic logic programs with function symbols
• Probabilistic inductive logic programming. Theory and applications
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• SWI-Prolog
• Algorithm 733: TOMP–Fortran modules for optimal control calculations
• Improving the variable ordering of OBDDs is NP-complete
• Structure learning of probabilistic logic programs by searching the clause space
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Logic Programming

This page was built for publication: Optimizing Probabilities in Probabilistic Logic Programs