APPSSAT: Approximate probabilistic planning using stochastic satisfiability

DOI10.1016/J.IJAR.2006.06.016MaRDI QIDQ997058zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

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

Cites work

• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Approximate linear programming for first-order MDPs
• Approximate policy iteration with a policy language bias: solving relational Markov decision processes
• Contingent planning under uncertainty via stochastic satisfiability
• Games against nature
• Stochastic Boolean satisfiability

Cited in

(9)

• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Probabilistic Reasoning by SAT Solvers
• Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
• Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
• Contingent planning under uncertainty via stochastic satisfiability
• A PCP theorem for interactive proofs and applications
• Hybrid metaheuristics for stochastic constraint programming
• Deliberation scheduling using GSMDPs in stochastic asynchronous domains
• Depth-based short-sighted stochastic shortest path problems

Describes a project that uses

Uses Software

• Chaff

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)