Weighted model counting without parameter variables

DOI10.1007/978-3-030-80223-3_10OpenAlexW3171238895MaRDI QIDQ2118293FDOQ2118293

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

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

Cites Work

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

Cited In (3)

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

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)