Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
From MaRDI portal
Recommendations
- Resolution for stochastic Boolean satisfiability
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
- Stochastic local search for SMT: combining theory solvers with WalkSAT
- Generalized Craig interpolation for stochastic satisfiability modulo theory problems
- Generalized Craig interpolation for stochastic Boolean satisfiability problems
Cites work
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Backjumping for quantified Boolean logic satisfiability
- Contingent planning under uncertainty via stochastic satisfiability
- Games against nature
- Handbook of constraint programming.
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- Stochastic Boolean satisfiability
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
- Stochastic constraint programming: A scenario-based approach
Cited in
(4)- Challenges in Constraint-Based Analysis of Hybrid Systems
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- Resolution for stochastic Boolean satisfiability
This page was built for publication: Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387634)