MAP Inference for Probabilistic Logic Programming

DOI10.1017/S1471068420000174zbMath1468.68051arXiv2008.01394MaRDI QIDQ5140005

Fabrizio Riguzzi, Marco Alberti, Riccardo Zese, Elena Bellodi

Publication date: 13 December 2020

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

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

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Efficient Knowledge Compilation Beyond Weighted Model Counting ⋮ Online event recognition over noisy data streams ⋮ Abduction with probabilistic logic programming under the distribution semantics ⋮ Nonground Abductive Logic Programming with Probabilistic Integrity Constraints

Uses Software

• ProbLog
• PITA

Cites Work

• Unnamed Item
• Unnamed Item
• The distribution semantics for normal programs with function symbols
• The independent choice logic for modelling multiple agents under uncertainty
• Efficient manipulation of decision diagrams
• Probabilistic inductive logic programming. Theory and applications
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty
• Emergence of Scaling in Random Networks
• The Complexity of Enumeration and Reliability Problems
• Abducing through negation as failure: stable models within the independent choice logic
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• Logic Programming

This page was built for publication: MAP Inference for Probabilistic Logic Programming