Efficient Knowledge Compilation Beyond Weighted Model Counting

DOI10.1017/S147106842200014XMaRDI QIDQ5038457zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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)

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

Cites work

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

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

Describes a project that uses

Uses Software

• NeurASP
• DeepProbLog
• Clingo
• PITA
• ProbLog

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)