Sciweavers

Share
AIML
2004

A Lower Complexity Bound for Propositional Dynamic Logic with Intersection

8 years 5 months ago
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.
Martin Lange
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where AIML
Authors Martin Lange
Comments (0)
books