Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
From MaRDI portal
Publication:2633263
DOI10.3390/A11090142zbMATH Open1461.68215OpenAlexW2890922211MaRDI QIDQ2633263FDOQ2633263
Authors: Yanyan Li 
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11090142
Recommendations
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs
- Approximate counting in SMT and value estimation for probabilistic programs
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Computational aspects of satisfiability (68R07)
Cites Work
- Effective lattice point counting in rational convex polytopes
- A random polynomial-time algorithm for approximating the volume of convex bodies
- On the Complexity of Computing the Volume of a Polyhedron
- The Wang-Landau algorithm reaches the flat histogram criterion in finite time
- A compositional modelling and analysis framework for stochastic hybrid systems
- Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors
- An efficient method to generate feasible paths for basis path testing
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
Cited In (1)
Uses Software
This page was built for publication: Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633263)
