APPSSAT: Approximate probabilistic planning using stochastic satisfiability
DOI10.1016/J.IJAR.2006.06.016zbMATH Open1119.68441OpenAlexW2731393059MaRDI QIDQ997058FDOQ997058
Authors: Stephen M. Majercik
Publication date: 19 July 2007
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2006.06.016
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- 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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Stochastic Boolean satisfiability
- Contingent planning under uncertainty via stochastic satisfiability
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes
- Games against nature
- Approximate policy iteration with a policy language bias: solving relational Markov decision processes
- Approximate linear programming for first-order MDPs
Cited In (9)
- Deliberation scheduling using GSMDPs in stochastic asynchronous domains
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- Depth-based short-sighted stochastic shortest path problems
- Probabilistic Reasoning by SAT Solvers
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A PCP theorem for interactive proofs and applications
- Contingent planning under uncertainty via stochastic satisfiability
- Hybrid metaheuristics for stochastic constraint programming
Uses Software
This page was built for publication: APPSSAT: Approximate probabilistic planning using stochastic satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997058)