Efficient Knowledge Compilation Beyond Weighted Model Counting

DOI10.1017/S147106842200014XOpenAlexW4289549925MaRDI QIDQ5038457

Angelika Kimmig, Rafael Kiesel, Pietro Totis

Publication date: 30 September 2022

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

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

zbMATH Keywords

designlogic programming methodology and applicationsanalysis and implementation of languages

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• ProbLog
• PITA
• Clingo
• DeepProbLog
• NeurASP

Cites Work

• Unnamed Item
• Unnamed Item
• Neural probabilistic logic programming in DeepProbLog
• Algebraic model counting
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty
• Probabilistic reasoning with answer sets
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• MAP Inference for Probabilistic Logic Programming
• Multi-shot ASP solving with clingo

This page was built for publication: Efficient Knowledge Compilation Beyond Weighted Model Counting