Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Stochastic SAT"”.

  1. On the relationship between satisfiability and partially observable Markov decision processes

    Stochastic satisfiability (SSAT), Quantified Boolean Satisfiability (QBF) and decision-theoretic planning in finite horizon partially observable Markov decision processes (POMDPs) are all PSPACE-Complete problems. Since they are all complete for the same complexity class, I show how to convert them …

    waterloo Repository record for On the relationship between satisfiability and partially observable Markov decision processes (opens in a new tab)