We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...