Efficient Knowledge Compilation Beyond Weighted Model Counting

DOI10.1017/S147106842200014XOpenAlexW4289549925MaRDI QIDQ5038457FDOQ5038457

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Neural probabilistic logic programming in DeepProbLog
• MAP Inference for Probabilistic Logic Programming

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)