Bounded-width QBF is PSPACE-complete.
Albert AtseriasSergi OlivaPublished in: J. Comput. Syst. Sci. (2014)
Keyphrases
- pspace complete
- np complete
- model checking
- satisfiability problem
- decision problems
- strips planning
- quantified boolean formulas
- temporal logic
- conjunctive normal form
- boolean formula
- causal graph
- tree automata
- computational complexity
- np hard
- constraint satisfaction problems
- search space
- coalition logic
- decision procedures
- search algorithm