I want to prove that Mixed Quantified Horn SAT is a PSPACE-complete problem. I have proved that it is PSPACE-hard. How can I prove that it is in PSPACE?
My study: To prove QSAT to be in PSPACE: Generate a boolean tree or circuit and evaluated it in O(n) space. Similarly, it has been done for the "Geography " problem and "GO" problem. SO, I think it should be possible to do for the mixedQhorn problem in the same way.