Symbolic and Quantitative Approaches to Reasoning with Uncertainty
From MaRDI portal
Publication:5473711
Recommendations
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability
- Contingent planning under uncertainty via stochastic satisfiability
- Probabilistic Reasoning by SAT Solvers
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- scientific article; zbMATH DE number 1216123
Cited in
(6)- APPSSAT: Approximate probabilistic planning using stochastic satisfiability
- Approximate planning
- Depth-based short-sighted stochastic shortest path problems
- Probabilistic Reasoning by SAT Solvers
- Probabilistic planning for continuous dynamic systems under bounded risk
- Contingent planning under uncertainty via stochastic satisfiability
This page was built for publication: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5473711)