Weighted model counting without parameter variables

DOI10.1007/978-3-030-80223-3_10MaRDI QIDQ2118293zbMATH OpenOpenAlexFDO

Authors Paulius Dilkas, Vaishak Belle

Publication date 22 March 2022

Full work available at URL https://www.pure.ed.ac.uk/ws/files/213422322/Weighted_Model_Counting_DILKAS_DOA05052021_AFV.pdf

zbMATH Keywords

Bayesian networksprobabilistic inferenceweighted model counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Algebraic model counting
• Compiling probabilistic graphical models using sentential decision diagrams
• Compiling relational Bayesian networks for exact inference
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• On probabilistic inference by weighted model counting
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Practical solution techniques for first-order MDPs
• Pseudo-Boolean optimization
• Semiring programming: a semantic framework for generalized sum product problems

Cited in

(3)

• Advanced SMT techniques for weighted model integration
• Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
• Automatically finding the right probabilities in Bayesian networks

Describes a project that uses

Uses Software

• htd

This page was built for publication: Weighted model counting without parameter variables

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