132 search results - page 6 / 27 » Lower bounds for modal logics |
100
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
105
click to vote
TACAS
2010
Springer
15 years 7 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...
113
Voted
EUSFLAT
2007
15 years 1 months ago
2007
In this work we propose a general approach for representing uncertainty measures in the framework of t-norm based logics. This approach is extended also to classes of measures lik...
112
Voted
TCS
2002
15 years 1 days ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
112
Voted
LPAR
2001
Springer
15 years 4 months ago
2001
Springer
Logical omniscience is a well known problem which makes traditional modal logics of knowledge, belief and intentions somewhat unrealistic from the point of view of modelling the be...