Contingent planning under uncertainty via stochastic satisfiability

DOI10.1016/S0004-3702(02)00379-XzbMath1082.68807MaRDI QIDQ814473

Michael L. Littman, Stephen M. Majercik

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Incomplete knowledgeUncertaintyContingent planningDecision-theoretic planningPartially observable Markov decision processesPlanning-as-satisfiabilityProbabilistic planningProbability of successStochastic satisfiability

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

Planning as satisfiability: heuristics, A resolution proof system for dependency stochastic Boolean satisfiability, On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability, Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic, Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems, Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework, APPSSAT: Approximate probabilistic planning using stochastic satisfiability, Probabilistic Reasoning by SAT Solvers, Contingent planning under uncertainty via stochastic satisfiability

Uses Software

• Walksat
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• Contingent planning under uncertainty via stochastic satisfiability
• The *-minimax search procedure for trees containing chance nodes
• Games against nature
• The complexity of stochastic games
• Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change
• The computational complexity of propositional STRIPS planning
• The complexity of mean payoff games on graphs
• Representing action: indeterminacy and ramifications
• Fast planning through planning graph analysis
• Implementing the Davis-Putnam method
• STRIPS: A new approach to the application of theorem proving to problem solving
• Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
• Contraction Mappings in the Theory Underlying Dynamic Programming
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Planning as heuristic search
• Stochastic Boolean satisfiability