Approximate counting in SMT and value estimation for probabilistic programs
From MaRDI portal
Publication:1683928
DOI10.1007/s00236-017-0297-2zbMath1380.68117arXiv1411.0659OpenAlexW2607296636MaRDI QIDQ1683928
Dmitry Chistikov, Rupak Majumdar, Rayna Dimitrova
Publication date: 1 December 2017
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0659
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Advanced SMT techniques for weighted model integration ⋮ Approximate weighted model integration on DNF structures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Making random choices invisible to the scheduler
- Games against nature
- Random generation of combinatorial structures from a uniform distribution
- NP is as easy as detecting unique solutions
- Semantics of probabilistic programs
- Uniform generation of NP-witnesses using an NP-oracle
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- Abstract interpretation of programs as Markov decision processes
- Probabilistic Abstract Interpretation
- Polytope Volume Computation
- Can the Measure of ∪ n 1 [ a i , b i be Computed in Less Than O(n logn) Steps?]
- Modeling and Reasoning with Bayesian Networks
- On Approximation Algorithms for # P
- Hard examples for resolution
- On the Complexity of Computing the Volume of a Polyhedron
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Satisfiability modulo counting
- Abstraction, Refinement and Proof for Probabilistic Systems
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Linear-Invariant Generation for Probabilistic Programs:
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs
- Probability
- Computational Complexity
This page was built for publication: Approximate counting in SMT and value estimation for probabilistic programs
