Contingent planning under uncertainty via stochastic satisfiability

DOI10.1016/S0004-3702(02)00379-XzbMATH Open1082.68807MaRDI QIDQ814473FDOQ814473

Authors: Stephen M. Majercik, Michael L. Littman 

Publication date: 7 February 2006

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

Recommendations

• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• AI*IA 2003: Advances in Artificial Intelligence
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• scientific article; zbMATH DE number 1216123

zbMATH Keywords

UncertaintyContingent planningDecision-theoretic planningIncomplete knowledgePartially observable Markov decision processesPlanning-as-satisfiabilityProbabilistic planningProbability of successStochastic satisfiability

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)

Cites Work

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

Cited In (18)

• Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• A resolution proof system for dependency stochastic Boolean satisfiability
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
• Generalized Craig interpolation for stochastic Boolean satisfiability problems
• On stochastic dynamic programming for solving large-scale planning problems under uncertainty
• Depth-based short-sighted stochastic shortest path problems
• Probabilistic Reasoning by SAT Solvers
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Chance-constrained Static Schedules for Temporally Probabilistic Plans
• Probabilistic planning for continuous dynamic systems under bounded risk
• Title not available (Why is that?)
• Human-aware contingent planning
• Planning as satisfiability: heuristics
• Contingent planning under uncertainty via stochastic satisfiability
• Planning with partial observability by SAT

Uses Software

• Walksat
• Graphplan

This page was built for publication: Contingent planning under uncertainty via stochastic satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814473)