291 search results - page 13 / 59 » On the Complexity of Fragments of Modal Logics |
106
click to vote
AIML
2008
15 years 3 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
117
click to vote
TACAS
2010
Springer
15 years 8 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
109
Voted
SLOGICA
2008
15 years 5 days ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
116
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
104
click to vote
LOGCOM
2006
15 years 1 months ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...