132 search results - page 3 / 27 » Lower bounds for modal logics |
CADE
2006
Springer
13 years 9 months ago
2006
Springer
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
JAPLL
2010
13 years 4 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
MFCS
1999
Springer
13 years 10 months ago
1999
Springer
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
AIML
2004
13 years 7 months ago
2004
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...