Contingent planning under uncertainty via stochastic satisfiability (Q814473): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The *-minimax search procedure for trees containing chance nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Mappings in the Theory Underlying Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing action: indeterminacy and ramifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and acting in partially observable stochastic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Boolean satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contingent planning under uncertainty via stochastic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Policy Iteration Algorithms for Discounted Markov Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Davis-Putnam method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 11:00, 24 June 2024

scientific article
Language Label Description Also known as
English
Contingent planning under uncertainty via stochastic satisfiability
scientific article

    Statements

    Contingent planning under uncertainty via stochastic satisfiability (English)
    0 references
    0 references
    0 references
    7 February 2006
    0 references
    0 references
    Probabilistic planning
    0 references
    Partially observable Markov decision processes
    0 references
    Decision-theoretic planning
    0 references
    Planning-as-satisfiability
    0 references
    Stochastic satisfiability
    0 references
    Contingent planning
    0 references
    Uncertainty
    0 references
    Incomplete knowledge
    0 references
    Probability of success
    0 references
    0 references
    0 references