Approximate weighted model integration on DNF structures

DOI10.1016/j.artint.2022.103753OpenAlexW4283728701MaRDI QIDQ2082501

Ralph Abboud, İsmail İlkan Ceylan, Radoslav Dimitrov

Publication date: 4 October 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.06726

zbMATH Keywords

approximationsprobabilistic inferenceweighted model countingweighted model integration

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• ProbLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Random generation of combinatorial structures from a uniform distribution
• Computing the volume is difficult
• General hit-and-run Monte Carlo sampling for evaluating multidimensional integrals
• Approximate counting in SMT and value estimation for probabilistic programs
• Open-world probabilistic databases: semantics, algorithms, complexity
• Advanced SMT techniques for weighted model integration
• On probabilistic inference by weighted model counting
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Markov logic networks
• On the hardness of approximate reasoning
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Probabilistic Databases
• Monte-Carlo approximation algorithms for enumeration problems
• Random walks and anO*(n5) volume algorithm for convex bodies
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Practical Polytope Volume Approximation
• Geodesic walks in polytopes

This page was built for publication: Approximate weighted model integration on DNF structures