Efficient Knowledge Compilation Beyond Weighted Model Counting

DOI10.1017/S147106842200014XOpenAlexW4289549925MaRDI QIDQ5038457FDOQ5038457

Authors: Rafael Kiesel, Pietro Totis, Angelika Kimmig 

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

Recommendations

• Algebraic model counting
• Aspmc: new frontiers of algebraic answer set counting
• On probabilistic inference by weighted model counting
• A compositional approach to probabilistic knowledge compilation
• Compacting Boolean formulae for inference in probabilistic logic programming

zbMATH Keywords

designlogic programming methodology and applicationsanalysis and implementation of languages

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• The PITA system: tabling and answer subsumption for reasoning under uncertainty
• Multi-shot ASP solving with clingo
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Probabilistic reasoning with answer sets
• Algebraic model counting
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• Neural probabilistic logic programming in DeepProbLog
• MAP inference for probabilistic logic programming
• Algebraic circuits for decision theoretic inference and learning

Cited In (3)

• Aspmc: new frontiers of algebraic answer set counting
• Semiring reasoning frameworks in AI and their computational complexity
• Boosting definability bipartition computation using SAT witnesses

Uses Software

• ProbLog
• PITA
• Clingo
• DeepProbLog
• NeurASP

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

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