PhD Defence: On the Relationship Between Satisfiability and Partially Observable Markov Decision Processes
Ricardo Salmon, PhD candidate
David R. Cheriton School of Computer Science
Stochastic satisfiability (SSAT), Quantified Boolean Satisfiability (QBF) and decision theoretic planning in infinite 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 into one another in polynomial time and space.