Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
24
click to vote
AIML
2004
favorite
Email
discuss
report
125
views
Logical Reasoning
»
more
AIML 2004
»
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection
13 years 10 months ago
Download
www2.tcs.ifi.lmu.de
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
Real-time Traffic
AIML 2004
|
AIML 2008
|
Exponential Time
|
Propositional Dynamic Logic
|
Turing Machines
|
claim paper
Related Content
»
Infinite State ModelChecking of Propositional Dynamic Logics
»
PDL with Intersection and Converse Is 2 EXPComplete
»
Propositional Dynamic Logic with Recursive Programs
»
Proof Complexity of Propositional Default Logic
»
Model checking propositional dynamic logic with all extras
»
On the Complexity of Reasoning About Dynamic Policies
»
Propositional Dynamic Logic for MessagePassing Systems
»
Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions
»
A PSpace Algorithm for Graded Modal Logic
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2004
Where
AIML
Authors
Martin Lange
Comments
(0)
Researcher Info
Logical Reasoning Study Group
Computer Vision