APPSSAT: Approximate probabilistic planning using stochastic satisfiability

DOI10.1016/J.IJAR.2006.06.016zbMath1119.68441OpenAlexW2731393059MaRDI QIDQ997058

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

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

Related Items (5)

A PCP theorem for interactive proofs and applications ⋮ 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 ⋮ Hybrid metaheuristics for stochastic constraint programming

Uses Software

• Chaff

Cites Work

• Contingent planning under uncertainty via stochastic satisfiability
• Games against nature
• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Stochastic Boolean satisfiability
• Unnamed Item
• Unnamed Item

This page was built for publication: APPSSAT: Approximate probabilistic planning using stochastic satisfiability