A Lower Complexity Bound for Propositional Dynamic Logic with Intersection

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, exponential time bounded Turing Machines.

• Type: Conference
• Year: 2004
• Where: AIML
• Authors: Martin Lange
• Keywords: AIML 2004, AIML 2008, Exponential Time, Propositional Dynamic Logic, Turing Machines